Ranking influential nodes by combining normalized degree centrality and fine-grained K-Shell

Xiuyong Mao, Fan Yang, Kaiyu Fan, Weizhou Hu, Chungui Li
{"title":"Ranking influential nodes by combining normalized degree centrality and fine-grained K-Shell","authors":"Xiuyong Mao, Fan Yang, Kaiyu Fan, Weizhou Hu, Chungui Li","doi":"10.1117/12.2667305","DOIUrl":null,"url":null,"abstract":"Identifying influential nodes is one of the crucial issues for controlling the network propagation process and exploring network properties in complex networks. Nevertheless, the accuracy of existing methods is still a challenge. In this paper, we rank influential nodes by considering tow aspects. On one hand, a normalized degree centrality is proposed to measure the local influence of each node. On the other hand, an improved fine-grained K-Shell decomposition is defined to measure the spreading ability of neighbors of a node. Further, a novel ranking measure is proposed by combining the normalized degree centrality and fine-grained K-Shell (NDF-FKS). The Susceptible-Infected-Recovery (SIR) model is used to simulate the network propagation process. Experiments with the model are performed on eight synthetic networks and four real networks. The NDF-FKS compared with six measures for accuracy and resolution. The results show that the accuracy of NDF-FKS outperforms existing six measures and has a competitive performance on distinguishing influential nodes.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth International Conference on Computer Information Science and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2667305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Identifying influential nodes is one of the crucial issues for controlling the network propagation process and exploring network properties in complex networks. Nevertheless, the accuracy of existing methods is still a challenge. In this paper, we rank influential nodes by considering tow aspects. On one hand, a normalized degree centrality is proposed to measure the local influence of each node. On the other hand, an improved fine-grained K-Shell decomposition is defined to measure the spreading ability of neighbors of a node. Further, a novel ranking measure is proposed by combining the normalized degree centrality and fine-grained K-Shell (NDF-FKS). The Susceptible-Infected-Recovery (SIR) model is used to simulate the network propagation process. Experiments with the model are performed on eight synthetic networks and four real networks. The NDF-FKS compared with six measures for accuracy and resolution. The results show that the accuracy of NDF-FKS outperforms existing six measures and has a competitive performance on distinguishing influential nodes.
结合归一化度中心性和细粒度K-Shell对影响节点进行排序
在复杂网络中,识别影响节点是控制网络传播过程和探索网络特性的关键问题之一。然而,现有方法的准确性仍然是一个挑战。本文从两个方面对影响节点进行排序。一方面,提出了一种归一化度中心性来衡量每个节点的局部影响;另一方面,定义了改进的细粒度K-Shell分解来度量节点邻居的扩散能力。进一步,将归一化度中心性与细粒度K-Shell (NDF-FKS)相结合,提出了一种新的排序度量方法。采用敏感-感染-恢复(SIR)模型模拟网络传播过程。在8个合成网络和4个真实网络上进行了实验。NDF-FKS比较了六种测量方法的精度和分辨率。结果表明,NDF-FKS的准确率优于现有的6种方法,在识别影响节点方面具有一定的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信