A New Method for Identifying Influential Spreaders in Complex Networks

被引:4
|
作者
Qiu, Liqing [1 ]
Liu, Yuying [1 ]
Zhang, Jianyi [1 ]
机构
[1] Shandong Univ Sci & Technol, Coll Comp Sci & Engn, Shandong Prov Key Lab Wisdom Mine Informat Technol, 579 Qianwangang Rd, Qingdao 266590, Shandong, Peoples R China
基金
中国国家自然科学基金;
关键词
complex networks; influential nodes; spreading capability; entropy weighting method; VIKOR; SOCIAL NETWORKS; H-INDEX; RANKING; IDENTIFICATION; NODES; CENTRALITY; USERS;
D O I
10.1093/comjnl/bxac180
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Social networks have an important role in the distribution of ideas. With the rapid development of the social networks, identifying the influential nodes provides a chance to turn the new potential of global information spread into reality. The measurement of the spreading capabilities of nodes is an attractive challenge in social networks analysis. In this paper, a novel method is proposed to identify the influential nodes in complex networks. The proposed method determines the spreading capability of a node based on its local and global positions. The degree centrality is improved by the Shannon entropy to measure the local influence of nodes. The k-shell method is improved by the clustering coefficient to measure the global influence of nodes. To rank the importance of nodes, the entropy weighting method is used to calculate the weight for the local and global influences. The Vlsekriterijumska Optimizacija I Kompromisno Resenje method is used to integrate the local and global influences of a node and obtain its importance. The experiments are conducted on 13 real-world networks to evaluate the performance of the proposed method. The experimental results show that the proposed method is more powerful and accurate to identify influential nodes than other methods.
引用
收藏
页码:362 / 375
页数:14
相关论文
共 50 条
  • [21] Identifying influential spreaders in complex networks based on kshell hybrid method
    Namtirtha, Amrita
    Dutta, Animesh
    Dutta, Biswanath
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 499 : 310 - 324
  • [22] Identifying Influential Spreaders in Complex Networks by an Improved Spectralrank Algorithm
    Liu, Chunfang
    Wang, Pei
    Chen, Aimin
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 736 - 741
  • [23] Identifying influential spreaders in complex networks by an improved gravity model
    Li, Zhe
    Huang, Xinyu
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [24] Identifying Influential Spreaders in Complex Multilayer Networks: A Centrality Perspective
    Basaras, Pavlos
    Iosifidis, George
    Katsaros, Dimitrios
    Tassiulas, Leandros
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (01): : 31 - 45
  • [25] Identifying Influential Spreaders in Complex Networks Based on Weighted Mixed Degree Decomposition Method
    Raamakirtinan, S.
    Livingston, L. M. Jenila
    WIRELESS PERSONAL COMMUNICATIONS, 2022, 127 (03) : 2103 - 2119
  • [26] Identifying multiple influential spreaders in complex networks based on spectral graph theory
    Cui, Dong-Xu
    He, Jia-Lin
    Xiao, Zi-Fei
    Ren, Wei-Ping
    CHINESE PHYSICS B, 2023, 32 (09)
  • [27] Identifying influential spreaders in complex networks through local effective spreading paths
    Wang, Xiaojie
    Zhang, Xue
    Yi, Dongyun
    Zhao, Chengli
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2017,
  • [28] Identifying influential spreaders in complex networks based on entropy weight method and gravity law
    闫小丽
    崔亚鹏
    倪顺江
    Chinese Physics B, 2020, 29 (04) : 664 - 672
  • [29] AIGCrank: A new adaptive algorithm for identifying a set of influential spreaders in complex networks based on gravity centrality
    Yang, Ping-Le
    Zhao, Lai-Jun
    Dong, Chen
    Xu, Gui-Qiong
    Zhou, Li-Xin
    CHINESE PHYSICS B, 2023, 32 (05)
  • [30] Identifying Influential Spreaders in Complex Networks by Considering the Impact of the Number of Shortest Paths
    Luan, Yangyang
    Bao, Zhongkui
    Zhang, Haifeng
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2021, 34 (06) : 2168 - 2181