基于网络渗透的大规模复杂网络扩散源推断。

IF 10.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yang Liu, Xiaoqi Wang, Xi Wang, Zhen Wang, Jurgen Kurths
{"title":"基于网络渗透的大规模复杂网络扩散源推断。","authors":"Yang Liu, Xiaoqi Wang, Xi Wang, Zhen Wang, Jurgen Kurths","doi":"10.1109/TNNLS.2023.3321767","DOIUrl":null,"url":null,"abstract":"<p><p>This article studies the diffusion-source-inference (DSI) problem, whose solution plays an important role in real-world scenarios such as combating misinformation and controlling diffusions of information or disease. The main task of the DSI problem is to optimize an estimator, such that the real source can be more precisely targeted. In this article, we assume that the state of a number of nodes, called observer set, in a network could be investigated if necessary, and study what configuration of those nodes could facilitate a better solution for the DSI problem. In particular, we find that the conventional error distance metric cannot precisely evaluate the effectiveness of varied DSI approaches in heterogeneous networks, and thus propose a novel and more general measurement, the candidate set, that is formulated to contain the diffusion source for sure. We propose the percolation-based evolutionary framework (PrEF) to optimize the observer set such that the candidate set can be minimized. Hence, one could further conduct more intensive investigation or search on only a few nodes to target the source. To achieve that, we first theoretically show that the size of the candidate set is bounded by the size of the largest component cover, and demonstrate that there are some similarities between the DSI problem and the network immunization problem. We find that, given the associated direction information of the diffusion is known on observers, the minimization of the candidate set is equivalent to the minimization of the order parameter if we view the observer set as the removal node set. Hence, PrEF is developed based on the network percolation and evolutionary algorithm. The effectiveness of the proposed method is validated on both synthetic and empirical networks in regard to varied circumstances. Our results show that the developed approach could achieve much smaller candidate sets compared to the state of the art in almost all cases, e.g., it is better in 26 out of 27 empirical networks and 155 out of 162 cases regarding the critical threshold. Meanwhile, our approach is also more stable, i.e., it works well irrespective of varied infection probabilities, diffusion models, and underlying networks. More importantly, we provide a framework for the analysis of the DSI problem in large-scale networks.</p>","PeriodicalId":13303,"journal":{"name":"IEEE transactions on neural networks and learning systems","volume":"PP ","pages":""},"PeriodicalIF":10.2000,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Diffusion Source Inference for Large-Scale Complex Networks Based on Network Percolation.\",\"authors\":\"Yang Liu, Xiaoqi Wang, Xi Wang, Zhen Wang, Jurgen Kurths\",\"doi\":\"10.1109/TNNLS.2023.3321767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>This article studies the diffusion-source-inference (DSI) problem, whose solution plays an important role in real-world scenarios such as combating misinformation and controlling diffusions of information or disease. The main task of the DSI problem is to optimize an estimator, such that the real source can be more precisely targeted. In this article, we assume that the state of a number of nodes, called observer set, in a network could be investigated if necessary, and study what configuration of those nodes could facilitate a better solution for the DSI problem. In particular, we find that the conventional error distance metric cannot precisely evaluate the effectiveness of varied DSI approaches in heterogeneous networks, and thus propose a novel and more general measurement, the candidate set, that is formulated to contain the diffusion source for sure. We propose the percolation-based evolutionary framework (PrEF) to optimize the observer set such that the candidate set can be minimized. Hence, one could further conduct more intensive investigation or search on only a few nodes to target the source. To achieve that, we first theoretically show that the size of the candidate set is bounded by the size of the largest component cover, and demonstrate that there are some similarities between the DSI problem and the network immunization problem. We find that, given the associated direction information of the diffusion is known on observers, the minimization of the candidate set is equivalent to the minimization of the order parameter if we view the observer set as the removal node set. Hence, PrEF is developed based on the network percolation and evolutionary algorithm. The effectiveness of the proposed method is validated on both synthetic and empirical networks in regard to varied circumstances. Our results show that the developed approach could achieve much smaller candidate sets compared to the state of the art in almost all cases, e.g., it is better in 26 out of 27 empirical networks and 155 out of 162 cases regarding the critical threshold. Meanwhile, our approach is also more stable, i.e., it works well irrespective of varied infection probabilities, diffusion models, and underlying networks. More importantly, we provide a framework for the analysis of the DSI problem in large-scale networks.</p>\",\"PeriodicalId\":13303,\"journal\":{\"name\":\"IEEE transactions on neural networks and learning systems\",\"volume\":\"PP \",\"pages\":\"\"},\"PeriodicalIF\":10.2000,\"publicationDate\":\"2023-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on neural networks and learning systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/TNNLS.2023.3321767\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on neural networks and learning systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/TNNLS.2023.3321767","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了扩散源推断(DSI)问题,其解决方案在现实世界中发挥着重要作用,如打击错误信息和控制信息或疾病的传播。DSI问题的主要任务是优化估计器,以便可以更精确地针对真实源。在本文中,我们假设在必要时可以调查网络中多个节点(称为观测器集)的状态,并研究这些节点的配置可以促进DSI问题的更好解决方案。特别是,我们发现传统的误差距离度量无法准确评估异构网络中各种DSI方法的有效性,因此提出了一种新的、更通用的测量方法,即候选集,该测量方法被公式化为肯定包含扩散源。我们提出了基于渗流的进化框架(PrEF)来优化观测器集,使得候选集可以最小化。因此,可以只对少数节点进行更深入的调查或搜索,以确定源。为了实现这一点,我们首先从理论上证明了候选集的大小受最大分量覆盖的大小的限制,并证明了DSI问题和网络免疫问题之间存在一些相似之处。我们发现,给定观测器上扩散的相关方向信息是已知的,如果我们将观测器集视为移除节点集,则候选集的最小化等价于阶参数的最小化。因此,PrEF是基于网络渗流和进化算法开发的。针对不同的情况,在综合网络和经验网络上验证了所提出方法的有效性。我们的结果表明,与现有技术相比,在几乎所有情况下,所开发的方法都可以实现更小的候选集,例如,在27个经验网络中的26个和162个临界阈值中的155个情况下,它都更好。同时,我们的方法也更稳定,即无论感染概率、扩散模型和底层网络如何,它都能很好地工作。更重要的是,我们为分析大规模网络中的DSI问题提供了一个框架。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Diffusion Source Inference for Large-Scale Complex Networks Based on Network Percolation.

This article studies the diffusion-source-inference (DSI) problem, whose solution plays an important role in real-world scenarios such as combating misinformation and controlling diffusions of information or disease. The main task of the DSI problem is to optimize an estimator, such that the real source can be more precisely targeted. In this article, we assume that the state of a number of nodes, called observer set, in a network could be investigated if necessary, and study what configuration of those nodes could facilitate a better solution for the DSI problem. In particular, we find that the conventional error distance metric cannot precisely evaluate the effectiveness of varied DSI approaches in heterogeneous networks, and thus propose a novel and more general measurement, the candidate set, that is formulated to contain the diffusion source for sure. We propose the percolation-based evolutionary framework (PrEF) to optimize the observer set such that the candidate set can be minimized. Hence, one could further conduct more intensive investigation or search on only a few nodes to target the source. To achieve that, we first theoretically show that the size of the candidate set is bounded by the size of the largest component cover, and demonstrate that there are some similarities between the DSI problem and the network immunization problem. We find that, given the associated direction information of the diffusion is known on observers, the minimization of the candidate set is equivalent to the minimization of the order parameter if we view the observer set as the removal node set. Hence, PrEF is developed based on the network percolation and evolutionary algorithm. The effectiveness of the proposed method is validated on both synthetic and empirical networks in regard to varied circumstances. Our results show that the developed approach could achieve much smaller candidate sets compared to the state of the art in almost all cases, e.g., it is better in 26 out of 27 empirical networks and 155 out of 162 cases regarding the critical threshold. Meanwhile, our approach is also more stable, i.e., it works well irrespective of varied infection probabilities, diffusion models, and underlying networks. More importantly, we provide a framework for the analysis of the DSI problem in large-scale networks.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE transactions on neural networks and learning systems
IEEE transactions on neural networks and learning systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
CiteScore
23.80
自引率
9.60%
发文量
2102
审稿时长
3-8 weeks
期刊介绍: The focus of IEEE Transactions on Neural Networks and Learning Systems is to present scholarly articles discussing the theory, design, and applications of neural networks as well as other learning systems. The journal primarily highlights technical and scientific research in this domain.
×
引用
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学术官方微信