基于解释性结构模型和改进的 Kshell 确定复杂网络中的重要传播者

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS
Tianchi Tong, Qian Dong, Wenying Yuan, Jinsheng Sun
{"title":"基于解释性结构模型和改进的 Kshell 确定复杂网络中的重要传播者","authors":"Tianchi Tong, Qian Dong, Wenying Yuan, Jinsheng Sun","doi":"10.1007/s00607-024-01268-z","DOIUrl":null,"url":null,"abstract":"<p>The identification of vital spreaders in complex networks has been one of the most interesting topics in network science. Several methods were proposed to deal with this challenge, but there still exist deficiencies in previous methods, such as excessive time complexity, inadequate accuracy of recognition results after dividing the topological structure, and the ignorance of neighbors’ attribute information in the links’ significance model. To address these issues and promote identifying ability more effectively, the proposed extended centrality upon hybrid information, named EISMC, introduces the interpretative structure model (ISM) and improves hierarchical weight results after the division in hierarchies. Based on the hierarchical structure of Improved Kshell decomposition (IKs), the weight value of each layer is updated, and meanwhile the local centrality under link significance (LinkC) is created to supplement local features in this method. In this paper, six real-world networks and nine comparison methods are applied to conduct a series of simulations and tests. Results demonstrate that the proposed method outperforms state-of-the-art algorithms in the identifying effects for good spreading influence.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"56 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Identifying vital spreaders in complex networks based on the interpretative structure model and improved Kshell\",\"authors\":\"Tianchi Tong, Qian Dong, Wenying Yuan, Jinsheng Sun\",\"doi\":\"10.1007/s00607-024-01268-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The identification of vital spreaders in complex networks has been one of the most interesting topics in network science. Several methods were proposed to deal with this challenge, but there still exist deficiencies in previous methods, such as excessive time complexity, inadequate accuracy of recognition results after dividing the topological structure, and the ignorance of neighbors’ attribute information in the links’ significance model. To address these issues and promote identifying ability more effectively, the proposed extended centrality upon hybrid information, named EISMC, introduces the interpretative structure model (ISM) and improves hierarchical weight results after the division in hierarchies. Based on the hierarchical structure of Improved Kshell decomposition (IKs), the weight value of each layer is updated, and meanwhile the local centrality under link significance (LinkC) is created to supplement local features in this method. In this paper, six real-world networks and nine comparison methods are applied to conduct a series of simulations and tests. Results demonstrate that the proposed method outperforms state-of-the-art algorithms in the identifying effects for good spreading influence.</p>\",\"PeriodicalId\":10718,\"journal\":{\"name\":\"Computing\",\"volume\":\"56 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00607-024-01268-z\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01268-z","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

识别复杂网络中的重要传播者一直是网络科学领域最有趣的课题之一。针对这一难题,人们提出了多种方法,但以往的方法仍存在时间复杂度过高、拓扑结构划分后识别结果准确性不足、链接意义模型中忽略邻居属性信息等缺陷。为了解决这些问题,更有效地提升识别能力,本文提出了混合信息的扩展中心度(EISMC),引入了解释性结构模型(ISM),改善了分层后的层次权重结果。该方法基于改进 Kshell 分解(IKS)的层次结构,更新各层的权重值,同时创建链接重要性下的局部中心性(LinkC)来补充局部特征。本文应用了六个真实世界网络和九种比较方法,进行了一系列模拟和测试。结果表明,所提出的方法在识别效果方面优于最先进的算法,具有良好的传播影响力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Identifying vital spreaders in complex networks based on the interpretative structure model and improved Kshell

Identifying vital spreaders in complex networks based on the interpretative structure model and improved Kshell

The identification of vital spreaders in complex networks has been one of the most interesting topics in network science. Several methods were proposed to deal with this challenge, but there still exist deficiencies in previous methods, such as excessive time complexity, inadequate accuracy of recognition results after dividing the topological structure, and the ignorance of neighbors’ attribute information in the links’ significance model. To address these issues and promote identifying ability more effectively, the proposed extended centrality upon hybrid information, named EISMC, introduces the interpretative structure model (ISM) and improves hierarchical weight results after the division in hierarchies. Based on the hierarchical structure of Improved Kshell decomposition (IKs), the weight value of each layer is updated, and meanwhile the local centrality under link significance (LinkC) is created to supplement local features in this method. In this paper, six real-world networks and nine comparison methods are applied to conduct a series of simulations and tests. Results demonstrate that the proposed method outperforms state-of-the-art algorithms in the identifying effects for good spreading influence.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computing
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.
×
引用
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学术官方微信