SHOMAN: an efficient method for finding the important nodes in a network

被引：0
|
作者：
Bathla S. [1 ]
Kanu O.S. [1 ]
Singh A. [1 ]
机构：
[1] Department of Computer Science and Engineering, National Institute of Technology Delhi, Delhi
来源：
International Journal of Business Intelligence and Data Mining | 2021年 / 19卷 / 03期
关键词：
Centrality; Clustering coefficient; Disease spreading; Robustness; Six-degrees of separation; Viral marketing;
D O I：
10.1504/IJBIDM.2021.118205
中图分类号：
学科分类号：
摘要：
In this paper, we propose and study the SHOMAN metric for determining the importance of a node in a network. The method is based on a significant feature of networks, namely clustering coefficient, and uses the principle of six degrees of separation to go through only up to six nodes to find the score of node influence. We demonstrate that our algorithm is highly effective at calculating the importance of nodes when compared to other centrality measures. We also propose that our method can be used in viral marketing and controlling disease spreading. Copyright © 2021 Inderscience Enterprises Ltd.
引用
收藏
页码：291 / 303
页数：12
相关论文
共 50 条
  • [31] Identification of Important Nodes in Directed Biological Networks: A Network Motif Approach
    Wang, Pei
    Lu, Jinhu
    Yu, Xinghuo
    PLOS ONE, 2014, 9 (08):
  • [32] Multi-Feature Fusion Identification of Important Nodes in Traffic Network
    Xiao, Yuxin
    Hu, Jianming
    Zhang, Zuo
    Zhang, Yi
    INTERNATIONAL CONFERENCE ON TRANSPORTATION AND DEVELOPMENT 2020 - TRAFFIC AND BIKE/PEDESTRIAN OPERATIONS, 2020, : 169 - 180
  • [33] Email Network Important Nodes Mining Using Core Number and PageRank
    Zhao, Xianghui
    Li, Zhirong
    Yi, Junkai
    2016 3RD INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE), 2016, : 363 - 367
  • [34] Identifying important nodes in complex software network based on ripple effects
    Wu, Hongfei (theworkone@sina.com), 1600, ICIC Express Letters Office (07):
  • [35] An efficient algorithm for finding all possible input nodes for controlling complex networks
    Xizhe Zhang
    Jianfei Han
    Weixiong Zhang
    Scientific Reports, 7
  • [36] An efficient algorithm for finding all possible input nodes for controlling complex networks
    Zhang, Xizhe
    Han, Jianfei
    Zhang, Weixiong
    SCIENTIFIC REPORTS, 2017, 7
  • [37] An Efficient Method for Identifying IDS Agent Nodes by Discovering Compromised Nodes in MANET
    Rafsanjani, Marjan Kuchaki
    Khavasi, Ali Asghar
    Movaghar, Ali
    SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING, VOL 1, PROCEEDINGS, 2009, : 625 - +
  • [38] AN EFFICIENT METHOD FOR FINDING REPEATS IN MOLECULAR SEQUENCES
    MARTINEZ, HM
    NUCLEIC ACIDS RESEARCH, 1983, 11 (13) : 4629 - 4634
  • [39] COMPUTATIONALLY EFFICIENT ESPRIT METHOD FOR DIRECTION FINDING
    Bao Zhiqiang Wu Shunjun Zhang Linrang (National Lab of Radar Signal Processing
    Journal of Electronics(China), 2007, (05) : 655 - 661
  • [40] On an efficient inclusion method for finding polynomial zeros
    Milosevic, Dusan M.
    Milosevic, Mimica R.
    Dzunic, Jovana
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 290 : 298 - 309
12345