具有可证明保证的多传染源识别
Multiple Infection Sources Identification with Provable Guarantees
摘要:
如果网络中出现了级联的后果,即在流行病爆发或谣言/蠕虫/病毒传播后出现了一组“受感染”的节点$V_I$,我们如何推断级联的来源?解决这个具有挑战性的问题对于计算机取证,漏洞分析和风险管理至关重要。尽管最近对这个问题的兴趣,大多数现有的工作只集中在单一的源检测或简单的网络拓扑结构,例如树或网格。在本文中,我们提出了一种新的方法来识别感染源,通过搜索一个种子集$S$,最小化之间的级联从$S$和$V_I$,给定的一组受感染的节点的\emph{symmetric difference}。我们的主要结果是一个近似算法,称为SISI,以确定感染源\emph{without the prior knowledge on the number of source nodes}。据我们所知,SISI是第一个用\emph{provable guarantee}算法解决一般图问题的算法。它返回具有高概率的$\frac{2}{(1-ε)^2}Δ$近似解,其中$Δ$表示$V_I$中可能感染网络中单个节点的最大节点数。我们在真实网络上的实验显示了我们的方法和SISI在检测真实源方面的优越性,将F1度量从最先进的NETSLEUTH的几个参数提高到大约50%。
英文摘要:
Given an aftermath of a cascade in the network, i.e. a set $V_I$ of "infected" nodes after an epidemic outbreak or a propagation of rumors/worms/viruses, how can we infer the sources of the cascade? Answering this challenging question is critical for computer forensic, vulnerability analysis, and risk management. Despite recent interest towards this problem, most of existing works focus only on single source detection or simple network topologies, e.g. trees or grids. In this paper, we propose a new approach to identify infection sources by searching for a seed set $S$ that minimizes the \emph{symmetric difference} between the cascade from $S$ and $V_I$, the given set of infected nodes. Our major result is an approximation algorithm, called SISI, to identify infection sources \emph{without the prior knowledge on the number of source nodes}. SISI, to our best knowledge, is the first algorithm with \emph{provable guarantee} for the problem in general graphs. It returns a $\frac{2}{(1-ε)^2}Δ$-approximate solution with high probability, where $Δ$ denotes the maximum number of nodes in $V_I$ that may infect a single node in the network. Our experiments on real-world networks show the superiority of our approach and SISI in detecting true source(s), boosting the F1-measure from few percents, for the state-of-the-art NETSLEUTH, to approximately 50\%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。