A new method to identify influential nodes based on relative entropy

被引:50
|
作者
Fei, Liguo [1 ]
Deng, Yong [1 ,2 ,3 ]
机构
[1] Southwest Univ, Sch Comp & Informat Sci, Chongqing 400715, Peoples R China
[2] Xi An Jiao Tong Univ, Inst Integrated Automat, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[3] Vanderbilt Univ, Sch Engn, 221 Kirkland Hall, Nashville, TN 37235 USA
基金
中国国家自然科学基金;
关键词
Complex networks; Influential nodes; Centrality measure; Relative entropy; TOPSIS; COMPLEX NETWORKS; WEIGHTED NETWORKS; BELIEF STRUCTURES; FAILURE MODE; D NUMBERS; CENTRALITY; MATRIX; FLOW; IDENTIFICATION; PAYOFFS;
D O I
10.1016/j.chaos.2017.08.010
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
How to identify influential nodes is still an open and vital issue in complex networks. To address this problem, a lot of centrality measures have been developed, however, only single measure is focused on by the existing studies, which has its own shortcomings. In this paper, a novel method is proposed to identify influential nodes using relative entropy and TOPSIS method, which combines the advantages of existing centrality measures. Because information flow spreads in different ways in different networks. In the specific network, the appropriate centrality measures should be considered to sort the nodes. In addition, the remoteness between the alternative and the positive/negetive ideal solution is redefined based on relative entropy, which is proven to be more effective in TOPSIS method. To demonstrate the effectiveness of the proposed method, four real networks are selected to conduct several experiments for identifying influential nodes, and the advantages of the method can be illustrated based on the experimental results. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:257 / 267
页数:11
相关论文
共 50 条
  • [1] Identify influential nodes in complex networks: A k-orders entropy-based method
    Wu, Yali
    Dong, Ang
    Ren, Yuanguang
    Jiang, Qiaoyong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2023, 632
  • [2] A new method to identify influential nodes based on combining of existing centrality measures
    Fei, Liguo
    Mo, Hongming
    Deng, Yong
    MODERN PHYSICS LETTERS B, 2017, 31 (26):
  • [3] A novel method to identify influential nodes based on hybrid topology structure
    Wan, Di
    Yang, Jianxi
    Zhang, Tingping
    Xiong, Yuanjun
    PHYSICAL COMMUNICATION, 2023, 58
  • [4] Influential Performance of Nodes Identified by Relative Entropy in Dynamic Networks
    Marjai, Peter
    Kiss, Attila
    VIETNAM JOURNAL OF COMPUTER SCIENCE, 2021, 8 (01) : 93 - 112
  • [5] Evidential method to identify influential nodes in complex networks
    Mo, Hongming
    Gao, Cai
    Deng, Yong
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2015, 26 (02) : 381 - 387
  • [6] Evidential method to identify influential nodes in complex networks
    Hongming Mo
    Cai Gao
    Yong Deng
    Journal of Systems Engineering and Electronics, 2015, 26 (02) : 381 - 387
  • [7] A novel method to identify influential nodes in complex networks
    Yang, Yuanzhi
    Yu, Lei
    Wang, Xing
    Chen, Siyi
    Chen, You
    Zhou, Yipeng
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2020, 31 (02):
  • [8] A novel method to identify influential nodes in complex networks based on gravity centrality
    Zhang, Qinyu
    Shuai, Bin
    Lu, Min
    INFORMATION SCIENCES, 2022, 618 : 98 - 117
  • [9] A Novel Method to Rank Influential Nodes in Complex Networks Based on Tsallis Entropy
    Chen, Xuegong
    Zhou, Jie
    Liao, Zhifang
    Liu, Shengzong
    Zhang, Yan
    ENTROPY, 2020, 22 (08)
  • [10] A hybrid influence method based on information entropy to identify the key nodes
    Zhong, Linfeng
    Gao, Xiangying
    Zhao, Liang
    Zhang, Lei
    Chen, Pengfei
    Yang, Hao
    Huang, Jin
    Pan, Weijun
    FRONTIERS IN PHYSICS, 2023, 11