Identifying vital nodes for influence maximization in attributed networks

被引:4
作者
Wang, Ying [1 ]
Zheng, Yunan [1 ]
Liu, Yiguang [1 ]
机构
[1] Sichuan Univ, Coll Comp Sci, Chengdu 610065, Sichuan, Peoples R China
关键词
SPREADERS; IDENTIFICATION; SET;
D O I
10.1038/s41598-022-27145-3
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Identifying a set of vital nodes to achieve influence maximization is a topic of general interest in network science. Many algorithms have been proposed to solve the influence maximization problem in complex networks. Most of them just use topology information of networks to measure the node influence. However, the node attribute is also an important factor for measuring node influence in attributed networks. To tackle this problem, we first propose an extension model of linear threshold (LT) propagation model to simulate the information propagation in attributed networks. Then, we propose a novel community-based method to identify a set of vital nodes for influence maximization in attributed networks. The proposed method considers both topology influence and attribute influence of nodes, which is more suitable for identifying vital nodes in attributed networks. A series of experiments are carried out on five real world networks and a large scale synthetic network. Compared with CELF, IMM, CoFIM, HGD, NCVoteRank and K-Shell methods, experimental results based on different propagation models show that the proposed method improves the influence spread by -2.28%to4.76%, -2.50%to16.97%, 0.18%to16.07, 22%to41.82%, 0.23%to11.24% and 10.78%to75.22.
引用
收藏
页数:12
相关论文
共 55 条
[1]   Community detection in attributed networks considering both structural and attribute similarities: two mathematical programming approaches [J].
Alinezhad, Esmaeil ;
Teimourpour, Babak ;
Sepehri, Mohammad Mehdi ;
Kargari, Mehrdad .
NEURAL COMPUTING & APPLICATIONS, 2020, 32 (08) :3203-3220
[2]   New trends in influence maximization models [J].
Azaouzi, Mehdi ;
Mnasri, Wassim ;
Ben Romdhane, Lotfi .
COMPUTER SCIENCE REVIEW, 2021, 40
[3]  
Bandyopadhyay S, 2019, AAAI CONF ARTIF INTE, P12
[4]  
BAVELAS A, 1950, J ACOUST SOC AM, V22, P723
[5]   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,
[6]   FACTORING AND WEIGHTING APPROACHES TO STATUS SCORES AND CLIQUE IDENTIFICATION [J].
BONACICH, P .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1972, 2 (01) :113-120
[7]  
Borgs C., 2014, P 25 ANN ACM SIAM S, P946
[8]   FIP: A fast overlapping community-based influence maximization algorithm using probability coefficient of global diffusion in social networks [J].
Bouyer, Asgarali ;
Beni, Hamid Ahmadi ;
Arasteh, Bahman ;
Aghaee, Zahra ;
Ghanbarzadeh, Reza .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 213
[9]   Influence maximization problem by leveraging the local traveling and node labeling method for discovering most influential nodes in social networks [J].
Bouyer, Asgarali ;
Beni, Hamid Ahmadi .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 592
[10]   LSMD: A fast and robust local community detection starting from low degree nodes in social networks [J].
Bouyer, Asgarali ;
Roghani, Hamid .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 113 :41-57