Community detection for emerging social networks

被引:0
作者
Qianyi Zhan
Jiawei Zhang
Philip Yu
Junyuan Xie
机构
[1] Nanjing University,National Key Laboratory for Novel Software Technology
[2] University of Illinois at Chicago,Institute for Data Science
[3] Tsinghua University,undefined
来源
World Wide Web | 2017年 / 20卷
关键词
Community detection; Cold start problem; Transfer learning; Data mining;
D O I
暂无
中图分类号
学科分类号
摘要
Many famous online social networks, e.g., Facebook and Twitter, have achieved great success in the last several years. Users in these online social networks can establish various connections via both social links and shared attribute information. Discovering groups of users who are strongly connected internally is defined as the community detection problem. Community detection problem is very important for online social networks and has extensive applications in various social services. Meanwhile, besides these popular social networks, a large number of new social networks offering specific services also spring up in recent years. Community detection can be even more important for new networks as high quality community detection results enable new networks to provide better services, which can help attract more users effectively. In this paper, we will study the community detection problem for new networks, which is formally defined as the “New Network Community Detection” problem. New network community detection problem is very challenging to solve for the reason that information in new networks can be too sparse to calculate effective similarity scores among users, which is crucial in community detection. However, we notice that, nowadays, users usually join multiple social networks simultaneously and those who are involved in a new network may have been using other well-developed social networks for a long time. With full considerations of network difference issues, we propose to propagate useful information from other well-established networks to the new network with efficient information propagation models to overcome the shortage of information problem. An effective and efficient method, Cat (Cold stArT community detector), is proposed in this paper to detect communities for new networks using information from multiple heterogeneous social networks simultaneously. Extensive experiments conducted on real-world heterogeneous online social networks demonstrate that Cat can address the new network community detection problem effectively.
引用
收藏
页码:1409 / 1441
页数:32
相关论文
共 23 条
[1]  
Belkin M(2003)Laplacian eigenmaps for dimensionality reduction and data representation Neural Comput. 15 1373-1396
[2]  
Niyogi P(2008)Sequential algorithm for fast clique percolation Phys. Rev. E 78 026109-416
[3]  
Kumpula JM(2007)A tutorial on spectral clustering Stat. Comput. 17 395-856
[4]  
Kivelä M(2002)On spectral clustering: Analysis and an algorithm Adv. Neural Inf. Proces. Syst. 2 849-818
[5]  
Kaski K(2005)Uncovering the overlapping community structure of complex networks in nature and society Nature 435 814-905
[6]  
Saramäki J(2007)Near linear time algorithm to detect community structures in large-scale networks Phys. Rev. E 76 036106-1009
[7]  
Luxburg UV(2000)NorMalized cuts and image segmentation IEEE Trans. Pattern Anal. Mach. Intell. 22 888-undefined
[8]  
Ng AY(2015)Community detection in social networks: an in-depth benchmarking study with a procedure-oriented framework Proc. VLDB Endowment 8 998-undefined
[9]  
Jordan MI(undefined)undefined undefined undefined undefined-undefined
[10]  
Weiss Y(undefined)undefined undefined undefined undefined-undefined