A new method to identify influential nodes based on relative entropy

被引:54
作者
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 条
  • [21] Identifying influential nodes based on local dimension
    Pu, Jun
    Chen, Xiaowu
    Wei, Daijun
    Liu, Qi
    Deng, Yong
    EPL, 2014, 107 (01)
  • [22] A novel measure to identify influential nodes in complex networks based on network global efficiency
    Zhang, Tingping
    Fang, Bin
    Liang, Xinyu
    MODERN PHYSICS LETTERS B, 2015, 29 (28):
  • [23] The random walk-based gravity model to identify influential nodes in complex networks
    Zhao, Jie
    Wen, Tao
    Jahanshahi, Hadi
    Cheong, Kang Hao
    INFORMATION SCIENCES, 2022, 609 : 1706 - 1720
  • [24] A Novel Model to Identify the Influential Nodes: Evidence Theory Centrality
    Zhao, Jie
    Song, Yutong
    Deng, Yong
    IEEE ACCESS, 2020, 8 : 46773 - 46780
  • [25] 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)
  • [26] A modified weighted TOPSIS to identify influential nodes in complex networks
    Hu, Jiantao
    Du, Yuxian
    Mo, Hongming
    Wei, Daijun
    Deng, Yong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 444 : 73 - 85
  • [27] A modified efficiency centrality to identify influential nodes in weighted networks
    Wang, Yunchuan
    Wang, Shasha
    Deng, Yong
    PRAMANA-JOURNAL OF PHYSICS, 2019, 92 (04):
  • [28] Influential Nodes Identification in Complex Networks via Information Entropy
    Guo, Chungu
    Yang, Liangwei
    Chen, Xiao
    Chen, Duanbing
    Gao, Hui
    Ma, Jing
    ENTROPY, 2020, 22 (02)
  • [29] Influential nodes ranking in complex networks: An entropy-based approach
    Zareie, Ahmad
    Sheikhahmadi, Amir
    Fatemi, Adel
    CHAOS SOLITONS & FRACTALS, 2017, 104 : 485 - 494
  • [30] Identifying influential nodes in complex networks based on AHP
    Bian, Tian
    Hu, Jiantao
    Deng, Yong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 479 : 422 - 436