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 条
  • [21] Identifying Influential Nodes in Complex Networks Based on Neighborhood Entropy Centrality
    Qiu, Liqing
    Zhang, Jianyi
    Tian, Xiangbo
    Zhang, Shuang
    COMPUTER JOURNAL, 2021, 64 (10): : 1465 - 1476
  • [22] Influential nodes ranking in complex networks: An entropy-based approach
    Zareie, Ahmad
    Sheikhahmadi, Amir
    Fatemi, Adel
    CHAOS SOLITONS & FRACTALS, 2017, 104 : 485 - 494
  • [23] CPR-TOPSIS: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy
    Dong, Chen
    Xu, Guiqiong
    Meng, Lei
    Yang, Pingle
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 603
  • [24] Information Entropy Based on Propagation Feature of Node for Identifying the Influential Nodes
    Zhong, Linfeng
    Bai, Yu
    Tian, Yan
    Luo, Chen
    Huang, Jin
    Pan, Weijun
    COMPLEXITY, 2021, 2021
  • [25] Identifying influential nodes: A new method based on network efficiency of edge weight updating
    Shang, Qiuyan
    Zhang, Bolong
    Li, Hanwen
    Deng, Yong
    CHAOS, 2021, 31 (03)
  • [26] Graph Energy Based Centrality Measure to Identify Influential Nodes in Social Networks
    Kamath, S. S.
    Mahadevi, S.
    2019 IEEE 5TH INTERNATIONAL CONFERENCE FOR CONVERGENCE IN TECHNOLOGY (I2CT), 2019,
  • [27] Identify A Group of Influential Nodes in Social Networks Based on Overlapping Community Detection
    Wang, Jing-Dong
    Mu, Qi-Zi
    Gao, Yan-Kun
    Meng, Fan-Qi
    Zhou, Li-Na
    Guo, Shuang
    Journal of Network Intelligence, 2022, 7 (04): : 894 - 908
  • [28] A new method for identifying influential nodes based on D-S evidence theory
    Cai, Die
    Wang, Zhixuan
    Wang, Ningkui
    Wei, Daijun
    2017 29TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2017, : 4603 - 4609
  • [29] A social network based approach to identify and rank influential nodes for smart city
    Tidke, Bharat Arun
    Mehta, Rupa
    Rana, Dipti
    Mittal, Divyani
    Suthar, Pooja
    KYBERNETES, 2021, 50 (02) : 568 - 587
  • [30] A community-based approach to identify the most influential nodes in social networks
    Hosseini-Pozveh, Maryam
    Zamanifar, Kamran
    Naghsh-Nilchi, Ahmad Reza
    JOURNAL OF INFORMATION SCIENCE, 2017, 43 (02) : 204 - 220