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 条
  • [41] Identifying influential nodes in complex networks based on spreading probability
    Ai, Jun
    He, Tao
    Su, Zhan
    Shang, Lihui
    [J]. CHAOS SOLITONS & FRACTALS, 2022, 164
  • [42] Identify influential nodes in complex networks based on Modified TOPSIS
    WuXuguang
    [J]. PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 1474 - 1479
  • [43] The identification of influential nodes based on structure similarity
    Zhao, Jie
    Song, Yutong
    Liu, Fan
    Deng, Yong
    [J]. CONNECTION SCIENCE, 2021, 33 (02) : 201 - 218
  • [44] Identify influential nodes in network of networks from the view of weighted information fusion
    Lei, Mingli
    Liu, Lirong
    Xiao, Fuyuan
    [J]. APPLIED INTELLIGENCE, 2023, 53 (07) : 8005 - 8023
  • [45] A novel method to identify influential nodes in complex networks based on gravity centrality
    Zhang, Qinyu
    Shuai, Bin
    Lu, Min
    [J]. INFORMATION SCIENCES, 2022, 618 : 98 - 117
  • [46] Ranking influential nodes in complex networks based on local and global structures
    Qiu, Liqing
    Zhang, Jianyi
    Tian, Xiangbo
    [J]. APPLIED INTELLIGENCE, 2021, 51 (07) : 4394 - 4407
  • [47] Identifying influential nodes in complex networks based on global and local structure
    Sheng, Jinfang
    Dai, Jinying
    Wang, Bin
    Duan, Guihua
    Long, Jun
    Zhang, Junkai
    Guan, Kerong
    Hu, Sheng
    Chen, Long
    Guan, Wanghao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 541
  • [48] Identifying Influential Nodes in Complex Networks Based on Local Effective Distance
    Zhang, Junkai
    Wang, Bin
    Sheng, Jinfang
    Dai, Jinying
    Hu, Jie
    Chen, Long
    [J]. INFORMATION, 2019, 10 (10)
  • [49] Finding influential nodes in social networks based on neighborhood correlation coefficient
    Zareie, Ahmad
    Sheikhahmadi, Amir
    Jalili, Mahdi
    Fasaei, Mohammad Sajjad Khaksar
    [J]. KNOWLEDGE-BASED SYSTEMS, 2020, 194 (194)
  • [50] Identifying Influential Nodes in Complex Networks Based on Local Neighbor Contribution
    Dai, Jinying
    Wang, Bin
    Sheng, Jinfang
    Sun, Zejun
    Khawaja, Faiza Riaz
    Ullah, Aman
    Dejene, Dawit Aklilu
    Duan, Guihua
    [J]. IEEE ACCESS, 2019, 7 : 131719 - 131731