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
关键词
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 条
  • [21] Churn Prediction by Finding Most Influential nodes in Social Network
    Pagare, Reena
    Khare, Akhil
    2016 INTERNATIONAL CONFERENCE ON COMPUTING, ANALYTICS AND SECURITY TRENDS (CAST), 2016, : 68 - 71
  • [22] Identification of Important Nodes in Power-Information Coupled Network
    Liu, Fangyu
    Xie, Gang
    Zhao, Zhengpeng
    2020 CHINESE AUTOMATION CONGRESS (CAC 2020), 2020, : 6329 - 6334
  • [23] Identifying important nodes affecting network security in complex networks
    Liu, Yongshan
    Wang, Jianjun
    He, Haitao
    Huang, Guoyan
    Shi, Weibo
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2021, 17 (02)
  • [24] EFFICIENT METHOD FOR FINDING MONOTHETIC GROUPS
    FARRIS, JS
    SYSTEMATIC ZOOLOGY, 1978, 27 (04): : 468 - 472
  • [25] Finding the key nodes to minimize the victims of the malicious information in complex network
    Zhou, Mingyang
    Liu, Hongwu
    Liao, Hao
    Liu, Gang
    Mao, Rui
    KNOWLEDGE-BASED SYSTEMS, 2024, 293
  • [26] Finding Influential Nodes in a Social Network from Information Diffusion Data
    Kimura, Masahiro
    Saito, Kazumi
    Nakano, Ryohei
    Motoda, Hiroshi
    SOCIAL COMPUTING AND BEHAVIORAL MODELING, 2009, : 138 - +
  • [27] Efficient cluster organization method of zigbee nodes
    Woo, S.-J. (cliot@wooam.com), 1600, Science and Engineering Research Support Society, 20 Virginia Court, Sandy Bay, Tasmania, Australia (07):
  • [28] Efficient Deployment Strategies for Network Localization With Assisting Nodes
    Gomez-Vega, Carlos A.
    Liu, Zhenyu
    Gutierrez, Carlos A.
    Win, Moe Z.
    Conti, Andrea
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2024, 23 (05) : 6272 - 6287
  • [29] Efficient Content Caching for Named Data Network Nodes
    Shekhawat, Virendra Singh
    Vineet, Ankur
    Gautam, Avinash
    PROCEEDINGS OF THE 16TH EAI INTERNATIONAL CONFERENCE ON MOBILE AND UBIQUITOUS SYSTEMS: COMPUTING, NETWORKING AND SERVICES (MOBIQUITOUS'19), 2019, : 11 - 19
  • [30] Energy efficient spatial distribution of nodes in a sensor network
    Prasad, Pratap
    Agrawal, Prathima
    2007 IEEE SARNOFF SYMPOSIUM, 2007, : 435 - 439