{"title":"一种基于链路预测的复杂网络超传播者集识别方法","authors":"Bayan Hosseini;Farshid Veisi;Amir Sheikhahmdi","doi":"10.1093/comnet/cnad007","DOIUrl":null,"url":null,"abstract":"Identifying a group of key nodes with enormous capability for spreading information to other network nodes is one of the favourable research topics in complex networks. In most existing methods, only the current status of the network is used for identifying and selecting the member of these groups. The main weakness of these methods is a lack of attention to the highly dynamic nature of complex networks and continuous changes in them in terms of creating and eliminating nodes and links. This matter makes the selected group have no proper performance in spreading information relative to other nodes. Therefore, this article presents a novel method for identifying spreader nodes and selecting a superior set from them. In the proposed method, the diffusion power of network nodes is calculated in the first step, and some are selected as influential nodes. In the following steps, it is tried to modify the list of selected nodes by predicting the network variation. Six datasets gathered from real-world networks are utilized for evaluation. The proposed method and other methods are tested to evaluate their spread of influence and time complexity. Results show that using the link prediction in the proposed method can enhance the spread of influence by the selected set compared to other methods so that the spread of influence in some datasets is more than 30\n<tex>$\\%$</tex>\n. On the other hand, the time complexity of the proposed method confirms its utility in very large networks.","PeriodicalId":2,"journal":{"name":"ACS Applied Bio Materials","volume":null,"pages":null},"PeriodicalIF":4.6000,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A method based on link prediction for identifying set of super-spreaders in complex networks\",\"authors\":\"Bayan Hosseini;Farshid Veisi;Amir Sheikhahmdi\",\"doi\":\"10.1093/comnet/cnad007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Identifying a group of key nodes with enormous capability for spreading information to other network nodes is one of the favourable research topics in complex networks. In most existing methods, only the current status of the network is used for identifying and selecting the member of these groups. The main weakness of these methods is a lack of attention to the highly dynamic nature of complex networks and continuous changes in them in terms of creating and eliminating nodes and links. This matter makes the selected group have no proper performance in spreading information relative to other nodes. Therefore, this article presents a novel method for identifying spreader nodes and selecting a superior set from them. In the proposed method, the diffusion power of network nodes is calculated in the first step, and some are selected as influential nodes. In the following steps, it is tried to modify the list of selected nodes by predicting the network variation. Six datasets gathered from real-world networks are utilized for evaluation. The proposed method and other methods are tested to evaluate their spread of influence and time complexity. Results show that using the link prediction in the proposed method can enhance the spread of influence by the selected set compared to other methods so that the spread of influence in some datasets is more than 30\\n<tex>$\\\\%$</tex>\\n. On the other hand, the time complexity of the proposed method confirms its utility in very large networks.\",\"PeriodicalId\":2,\"journal\":{\"name\":\"ACS Applied Bio Materials\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2023-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS Applied Bio Materials\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10075380/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATERIALS SCIENCE, BIOMATERIALS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Bio Materials","FirstCategoryId":"100","ListUrlMain":"https://ieeexplore.ieee.org/document/10075380/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATERIALS SCIENCE, BIOMATERIALS","Score":null,"Total":0}
A method based on link prediction for identifying set of super-spreaders in complex networks
Identifying a group of key nodes with enormous capability for spreading information to other network nodes is one of the favourable research topics in complex networks. In most existing methods, only the current status of the network is used for identifying and selecting the member of these groups. The main weakness of these methods is a lack of attention to the highly dynamic nature of complex networks and continuous changes in them in terms of creating and eliminating nodes and links. This matter makes the selected group have no proper performance in spreading information relative to other nodes. Therefore, this article presents a novel method for identifying spreader nodes and selecting a superior set from them. In the proposed method, the diffusion power of network nodes is calculated in the first step, and some are selected as influential nodes. In the following steps, it is tried to modify the list of selected nodes by predicting the network variation. Six datasets gathered from real-world networks are utilized for evaluation. The proposed method and other methods are tested to evaluate their spread of influence and time complexity. Results show that using the link prediction in the proposed method can enhance the spread of influence by the selected set compared to other methods so that the spread of influence in some datasets is more than 30
$\%$
. On the other hand, the time complexity of the proposed method confirms its utility in very large networks.