A new method to identify influential nodes based on relative entropy

被引:55
作者
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
相关论文
共 66 条
[1]  
[Anonymous], 1981, MULTIPLE ATTRIBUTE D, DOI [10.1007/978-3-642- 48318-9_3, DOI 10.1007/978-3-642-48318-9_3]
[2]   Immunization of susceptible-infected model on scale-free networks [J].
Bai, Wen-He ;
Zhou, Tao ;
Wang, Bing-Hong .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2007, 384 (02) :656-662
[3]   FACTORING AND WEIGHTING APPROACHES TO STATUS SCORES AND CLIQUE IDENTIFICATION [J].
BONACICH, P .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1972, 2 (01) :113-120
[4]   Eigenvector-like measures of centrality for asymmetric relations [J].
Bonacich, P ;
Lloyd, P .
SOCIAL NETWORKS, 2001, 23 (03) :191-201
[5]   Centrality and network flow [J].
Borgatti, SP .
SOCIAL NETWORKS, 2005, 27 (01) :55-71
[6]  
Brin S, 2012, COMPUT NETW, V56, P3825, DOI 10.1016/j.comnet.2012.10.007
[7]   Path diversity improves the identification of influential spreaders [J].
Chen, Duan-Bing ;
Xiao, Rui ;
Zeng, An ;
Zhang, Yi-Cheng .
EPL, 2013, 104 (06)
[8]  
Cover T., 2006, ELEMENTS INFORM THEO, P19
[9]   An Evidential Axiomatic Design Approach for Decision Making Using the Evaluation of Belief Structure Satisfaction to Uncertain Target Values [J].
Deng, Xinyang ;
Jiang, Wen .
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2018, 33 (01) :15-32
[10]   Zero-Sum Matrix Game with Payoffs of Dempster-Shafer Belief Structures and Its Applications on Sensors [J].
Deng, Xinyang ;
Jiang, Wen ;
Zhang, Jiandong .
SENSORS, 2017, 17 (04)