A balanced modularity maximization link prediction model in social networks

被引:27
作者
Wu, Jiehua [1 ,2 ]
Zhang, Guoji [1 ]
Ren, Yazhou [3 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China
[2] Guangdong Polytech Ind & Commerce, Dept Comp, Guangzhou, Guangdong, Peoples R China
[3] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Big Data Res Ctr, Chengdu, Peoples R China
关键词
Link prediction; Social network; Community detection; Modularity; COMPLEX NETWORKS; COMMUNITIES; ORGANIZATION;
D O I
10.1016/j.ipm.2016.10.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Link prediction has been becoming an important research topic due to the rapid growth of social networks. Community-based link prediction methods are proposed to incorporate community information in order to achieve accurate prediction. However, the performance of such methods is sensitive to the selection of community detection algorithms, and they also fail to capture the correlation between link formulation and community evolution. In this paper we introduce a balanced Modularity-Maximization Link Prediction (MMLP) model to address this issue. The idea of MMLP is to integrate the formulation of two types of links into a partitioned network generative model. We proposed a probabilistic algorithm to emphasize the role of innerLinks, which correspondingly maximizes the network modularity. Then, a trade-off technique is designed to maintain the network in a stable state of equilibrium. We also present an effective feature aggregation method by exploring two variations of network features. Our proposed method can overcome the limit of several community-based methods and the extensive experimental results on both synthetic and real-world benchmark data demonstrate its effectiveness and robustness. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:295 / 307
页数:13
相关论文
共 45 条
[1]  
[Anonymous], 2012, 18 ACM SIGKDD INT C, DOI DOI 10.1145/2339530.2339730
[2]  
[Anonymous], 2009, SDM, DOI DOI 10.1137/1.9781611972795.94
[3]  
[Anonymous], 2009, Social computing data repository at ASU
[4]  
[Anonymous], 1999, PAGERANK CITATION RA
[5]  
[Anonymous], STOCHASTIC RELATIONA
[6]  
[Anonymous], 2006, AAAI
[7]  
[Anonymous], 2012, P 5 ACM INT C WEB SE, DOI DOI 10.1145/2124295.2124373
[8]  
[Anonymous], 2011, P 20 ACM C INFORM KN
[9]  
[Anonymous], 2010, P 16 ACM SIGKDD INT
[10]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512