Evidential method to identify influential nodes in complex networks

被引：0
|
作者：
Hongming Mo [1 ,2 ]
Cai Gao [1 ]
Yong Deng [1 ,3 ,4 ]
机构：
[1] School of Computer and Information Science, Southwest University
[2] Department of the Tibetan Language, Sichuan University of Nationalities
[3] School of Automation, Northwestern Polytechnical University
[4] School of Engineering, Vanderbilt University
来源：
Journal of Systems Engineering and Electronics | 2015年 / 26卷 / 02期
基金：
中央高校基本科研业务费专项资金资助; 国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词：
Dempster-Shafer evidence theory(D-S theory); belief function; complex networks; influential nodes; evidential centrality; comprehensive measure;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality measure is proposed based on the Dempster-Shafer evidence theory.The existing measures of degree centrality, betweenness centrality and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.
引用
收藏
页码：381 / 387
页数：7
相关论文
共 50 条
  • [1] Evidential method to identify influential nodes in complex networks
    Mo, Hongming
    Gao, Cai
    Deng, Yong
    [J]. JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2015, 26 (02) : 381 - 387
  • [2] A novel method to identify influential nodes in complex networks
    Yang, Yuanzhi
    Yu, Lei
    Wang, Xing
    Chen, Siyi
    Chen, You
    Zhou, Yipeng
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2020, 31 (02):
  • [3] A new evidential methodology of identifying influential nodes in complex networks
    Bian, Tian
    Deng, Yong
    [J]. CHAOS SOLITONS & FRACTALS, 2017, 103 : 101 - 110
  • [4] 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
  • [5] Evidential identification of influential nodes in network of networks
    Li, Meizhu
    Zhang, Qi
    Deng, Yong
    [J]. CHAOS SOLITONS & FRACTALS, 2018, 117 : 283 - 296
  • [6] Identify influential nodes in complex networks based on Modified TOPSIS
    WuXuguang
    [J]. PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 1474 - 1479
  • [7] A method based on k-shell decomposition to identify influential nodes in complex networks
    Bakhtyar Rafeeq HamaKarim
    Rojiar Pir Mohammadiani
    Amir Sheikhahmadi
    Bryar Rafiq Hamakarim
    Mehri Bahrami
    [J]. The Journal of Supercomputing, 2023, 79 : 15597 - 15622
  • [8] A modified weighted TOPSIS to identify influential nodes in complex networks
    Hu, Jiantao
    Du, Yuxian
    Mo, Hongming
    Wei, Daijun
    Deng, Yong
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 444 : 73 - 85
  • [9] A method based on k-shell decomposition to identify influential nodes in complex networks
    HamaKarim, Bakhtyar Rafeeq
    Mohammadiani, Rojiar Pir
    Sheikhahmadi, Amir
    Hamakarim, Bryar Rafiq
    Bahrami, Mehri
    [J]. JOURNAL OF SUPERCOMPUTING, 2023, 79 (14): : 15597 - 15622
  • [10] Identify influential nodes in complex networks: A k-orders entropy-based method
    Wu, Yali
    Dong, Ang
    Ren, Yuanguang
    Jiang, Qiaoyong
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2023, 632
12345