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 条
  • [41] A Novel Model to Identify the Influential Nodes: Evidence Theory Centrality
    Zhao, Jie
    Song, Yutong
    Deng, Yong
    IEEE ACCESS, 2020, 8 : 46773 - 46780
  • [42] A modified efficiency centrality to identify influential nodes in weighted networks
    Wang, Yunchuan
    Wang, Shasha
    Deng, Yong
    PRAMANA-JOURNAL OF PHYSICS, 2019, 92 (04):
  • [43] A community-based simulated annealing approach with a new structure-based neighborhood search to identify influential nodes in social networks
    Farzaneh Rajaee Abyaneh
    Nasrollah Moghadam Charkari
    Mehdy Roayaei
    Soft Computing, 2025, 29 (3) : 1567 - 1585
  • [44] 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)
  • [45] Influential nodes identification method based on adaptive adjustment of voting ability
    Wang, Guan
    Alias, Syazwina Binti
    Sun, Zejun
    Wang, Feifei
    Fan, Aiwan
    Hu, Haifeng
    HELIYON, 2023, 9 (05)
  • [46] An Edge Contribution-Based Approach to Identify Influential Nodes from Online Social Networks
    Muhuri, Samya
    Chakraborty, Susanta
    Setua, S. K.
    PROCEEDINGS OF 2016 IEEE INTERNATIONAL SYMPOSIUM ON NANOELECTRONIC AND INFORMATION SYSTEMS (INIS), 2016, : 155 - 160
  • [47] GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
    Tu, Dengqin
    Xu, Guiqiong
    Meng, Lei
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2021, 35 (17):
  • [48] Measure the structure similarity of nodes in complex networks based on relative entropy
    Zhang, Qi
    Li, Meizhu
    Deng, Yong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 491 : 749 - 763
  • [49] Multi-factor information matrix: A directed weighted method to identify influential nodes in social networks
    Wang, Yan
    Zhang, Ling
    Yang, Junwen
    Yan, Ming
    Li, Haozhan
    CHAOS SOLITONS & FRACTALS, 2024, 180
  • [50] New Retrieval Method Based on Relative Entropy for LanguageModeling with Different Smoothing Methods
    霍华
    刘俊强
    冯博琴
    Railway Engineering Science, 2006, (02) : 113 - 120