A neighbour scale fixed approach for influence maximization in social networks

被引:0
作者
Xiaobin Rui
Xiaodong Yang
Jianping Fan
Zhixiao Wang
机构
[1] China University of Mining and Technology,School of Computer Science and Technology
[2] Mine Digitization Engineering Research Center of the Ministry of Education,Department of Computer Science
[3] University of North Carolina at Charlotte,undefined
来源
Computing | 2020年 / 102卷
关键词
Influence maximization; Social network; Influence strength; Fixed neighbour scale; Multi-level neighbour; 91D30;
D O I
暂无
中图分类号
学科分类号
摘要
Influence maximization is currently a most extensively researched topic in social network analysis. Existing approaches tackle this task by either pursuing the real influence strength of a node or designing proper measurements for estimating it. The degree is a popularly adopted influence strength metric, based on which a variety of methods have been developed. Though with good efficiency, degree-based methods suffer unsatisfactory accuracy since this metric only covers a limited considered scale over the whole network of interest and also lacks discriminatory power. In this paper, we propose a novel influence maximization method, named Fixed Neighbour Scale (FNS), which extracts useful information from multiple levels of neighbours for a target node to estimate its influence strength, rather than only considering directly connected neighbours as in degree-based methods. To facilitate the implementation of FNS, we also present a centrality measurement termed FNS-dist, which estimates a node’s influence strength by summing its multi-level neighbours’ weights that are mainly determined by their distances to the target node. Experiments conducted on nine networks of different sizes and categories show that the proposed FNS method achieves excellent and stable performance compared with other algorithms based on designing metrics for measuring influence strength. We also exhibit that FNS-dist is a superior alternative centrality which is more proper and precise than the degree.
引用
收藏
页码:427 / 449
页数:22
相关论文
共 73 条
[1]  
Bavelas A(1950)Communication patterns in task-oriented groups J Acoust Soc Am 22 725-730
[2]  
Bonacich P(2001)Eigenvector-like measures of centrality for asymmetric relations Soc Netw 23 191-201
[3]  
Lloyd P(2003)Geodesic distance in planar graphs Nucl Phys B 663 535-567
[4]  
Bouttier J(2014)Cim: community-based influence maximization in social networks ACM Trans Intell Syst Technol 5 25-115
[5]  
Di Francesco P(2006)Detecting rich-club ordering in complex networks Nat Phys 2 110-128
[6]  
Guitter E(2000)Graph theory Math Gaz 173 67-41
[7]  
Chen YC(1977)A set of measures of centrality based on betweenness Sociometry 40 35-1872
[8]  
Zhu WY(2003)Self-similar community structure in a network of human interactions Phys Rev E 68 065103-294
[9]  
Peng WC(2007)Graph evolution: densification and shrinking diameters ACM Trans Knowl Discov Data 1 2-916
[10]  
Lee WC(2018)Influence maximization on social graphs: a survey IEEE Trans Knowl Data Eng 30 1852-14