The identification of influential nodes based on structure similarity

被引:33
作者
Zhao, Jie [1 ]
Song, Yutong [1 ]
Liu, Fan [1 ]
Deng, Yong [1 ,2 ]
机构
[1] Univ Elect Sci & Technol China, Inst Fundamental & Frontier Sci, Chengdu 610054, Peoples R China
[2] Shannxi Normal Univ, Sch Educ, Xian 710062, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Complex networks; influential nodes; PageRank; K-L divergence; SI model; COMPLEX NETWORKS; SMART CARD; SPREADERS; CENTRALITY;
D O I
10.1080/09540091.2020.1806203
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The identification of influential nodes in complex networks is an open issue. To address it, many centrality measures have been proposed, among which the most representative iteration algorithm is the PageRank algorithm. However, it ignores the correlation between nodes and assumes that the jumping probability from a node to its adjacent nodes is the same. To make up it, we proposed a method to improve the PageRank based on the structural similarity of nodes calculated by Kullback-Leibler divergence. The Susceptible-infected (SI) model was used in six real networks, and the results of comparison experiments demonstrate the effectiveness of the proposed method.
引用
收藏
页码:201 / 218
页数:18
相关论文
共 50 条
[41]  
WANG HP, 2019, 2019 IEEE MIL POW, pNI326, DOI DOI 10.1109/ptc.2019.8810629
[42]   Onymity promotes cooperation in social dilemma experiments [J].
Wang, Zhen ;
Jusup, Marko ;
Wang, Rui-Wu ;
Shi, Lei ;
Iwasa, Yoh ;
Moreno, Yamir ;
Kurths, Juergen .
SCIENCE ADVANCES, 2017, 3 (03)
[43]   Vital spreaders identification in complex networks with multi-local dimension [J].
Wen, Tao ;
Pelusi, Danilo ;
Deng, Yong .
KNOWLEDGE-BASED SYSTEMS, 2020, 195
[44]  
Xu S, 2019, IEEE T CYBERNETICS, V49, P4253, DOI [10.1109/TCYB.2018.2861568, 10.1109/LGRS.2018.2852560]
[45]   A bio-inspired optimal network division method [J].
Yang, Hanchao ;
Liu, Yujia ;
Wan, Qian ;
Deng, Yong .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 527
[46]   Measure the structure similarity of nodes in complex networks based on relative entropy [J].
Zhang, Qi ;
Li, Meizhu ;
Deng, Yong .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 491 :749-763
[47]   Analysing rumours spreading considering self-purification mechanism [J].
Zhang, Yaming ;
Liu, Fei ;
Koura, Yaya H. ;
Wang, Hao .
CONNECTION SCIENCE, 2021, 33 (01) :81-94
[48]   An edge streaming data processing framework for autonomous driving [J].
Zhao, Hang ;
Yao, LinBin ;
Zeng, ZhiXin ;
Li, DongHua ;
Xie, JinLiang ;
Zhu, WeiLing ;
Tang, Jie .
CONNECTION SCIENCE, 2021, 33 (02) :173-200
[49]   An Efficient Network Method for Time Series Forecasting Based on the DC Algorithm and Visibility Relation [J].
Zhao, Junyin ;
Mo, Hongming ;
Deng, Yong .
IEEE ACCESS, 2020, 8 (08) :7598-7608
[50]   Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity [J].
Zhou, Tao ;
Liu, Jian-Guo ;
Bai, Wen-Jie ;
Chen, Guanrong ;
Wang, Bing-Hong .
PHYSICAL REVIEW E, 2006, 74 (05)