Community detection for emerging social networks

被引:17
作者
Zhan, Qianyi [1 ]
Zhang, Jiawei [2 ]
Yu, Philip [2 ,3 ]
Xie, Junyuan [1 ]
机构
[1] Nanjing Univ, Natl Key Lab Novel Software Technol, Nanjing, Jiangsu, Peoples R China
[2] Univ Illinois, Chicago, IL 60607 USA
[3] Tsinghua Univ, Inst Data Sci, Beijing, Peoples R China
来源
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS | 2017年 / 20卷 / 06期
基金
国家重点研发计划;
关键词
Community detection; Cold start problem; Transfer learning; Data mining;
D O I
10.1007/s11280-017-0441-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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
页数:33
相关论文
共 54 条
[1]  
[Anonymous], 2012, P 21 ACM INT C INFOR, DOI [DOI 10.1145/2396761.2398496, DOI 10.1145/2396761.2398496.URL]
[2]  
[Anonymous], 2010, A Survey on Transfer Learning
[3]  
[Anonymous], 2013, P 6 ACM INT C WEB SE, DOI DOI 10.1145/2433396.2433405
[4]  
Banfield J., 1993, MODEL BASED GAUSSIAN
[5]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[6]  
Chakrabarti D, 2004, LECT NOTES ARTIF INT, V3202, P112
[7]  
Cimiano P., 2004, ECAI
[8]  
GACS P., 1999, COMPLEXITY ALGORITHM
[9]  
Hastie T., 2009, The Elements of Statistical Learning: Data Mining, Inference and Prediction, V2, P1
[10]  
Hopner F., 1999, FUZZY CLUSTER ANAL M