Tianchi Tong, Qian Dong, Wenying Yuan, Jinsheng Sun
{"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}
引用次数: 0
Abstract
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 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.