Exploiting social circle broadness for influential spreaders identification in social networks

被引:10
作者
Wang, Senzhang [1 ]
Wang, Fang [1 ]
Chen, Yan [1 ]
Liu, Chunyang [2 ]
Li, Zhoujun [1 ]
Zhang, Xiaoming [1 ]
机构
[1] Beihang Univ, Beijing 100191, Peoples R China
[2] Coordinat Ctr China, Natl Comp Network Emergency Response Tech Team, Beijing, Peoples R China
来源
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS | 2015年 / 18卷 / 03期
基金
中国国家自然科学基金;
关键词
Social circle; Information propagation; Influential identification; COMPLEX NETWORKS;
D O I
10.1007/s11280-014-0277-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Influential spreaders identification in social networks contributes to optimize the use of available resources and ensure the more efficient spread of information. In contrast to common belief that highly connected or core located users are most crucial spreaders, this paper shows that both user's local and global structural properties matter in information diffusion. We propose a new metric, social circle broadness, to measure a user's information spreading influence by qualitatively combining the two above properties. Firstly, a definition of social circle diversity is introduced to measure the dispersion extent of a user's friends distribution in the network. Based on it, a method to calculate each user's local social circle broadness is presented. Preliminary experiments on a coauthor dataset demonstrate the effectiveness of social circle broadness in information diffusion. Furthermore, a social circle weighted PageRank (SCWPR) algorithm is proposed to iteratively rank each user's global social circle broadness. We conduct extensive comparison experiments against six state-of-the-art baseline methods on four real social network datasets. The results show that SCWPR outperforms all of them for influential spreaders identification in information propagation.
引用
收藏
页码:681 / 705
页数:25
相关论文
共 40 条
[1]  
Aditya P., 2011, P 4 ACM INT C WEB SE
[2]  
Amitl G., 2010, P 3 ACM INT C WEB SE
[3]  
ANDERSON R M, 1991
[4]  
[Anonymous], 2010, P 3 ACM INT C WEB SE, DOI DOI 10.1145/1718487.1718520
[5]  
Baumes J, 2005, AC 2005 P IADIS INT, P22
[6]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[7]   On variants of shortest-path betweenness centrality and their generic computation [J].
Brandes, Ulrik .
SOCIAL NETWORKS, 2008, 30 (02) :136-145
[8]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[9]  
Burt R., 1992, Structure holes: The social structure of competition
[10]   SAIL: Summation-bAsed Incremental Learning for Information-Theoretic Text Clustering [J].
Cao, Jie ;
Wu, Zhiang ;
Wu, Junjie ;
Xiong, Hui .
IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (02) :570-584