arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.1671cs.SIcs.DSphysics.soc-ph
收藏

多树扩散网络的次模推断

Submodular Inference of Diffusion Networks from Multiple Trees

Manuel Gomez Rodriguez, Bernhard Schölkopf

摘要:

信息、影响力和疾病的扩散和传播是通过越来越大的网络进行的。我们观察节点何时复制信息,做出决定或被感染,但网络通常是隐藏或未被观察的。由于网络是高度动态的,变化和增长迅速,我们只观察到一个相对较小的一组级联之前,网络的显着变化。基于小级联集的可扩展网络推理对于理解管理扩散的快速演变的动态是必要的。在这篇文章中,我们开发了一种可扩展的近似算法,具有可证明的近最优性能,基于子模最大化,在这种情况下实现了高精度,解决了Gomez-Rodriguez等人(2010)首次提出的开放问题。对合成和真实扩散数据的实验表明,我们的算法在实践中实现了准确性和运行时间之间的最佳权衡。

英文摘要:

Diffusion and propagation of information, influence and diseases take place over increasingly larger networks. We observe when a node copies information, makes a decision or becomes infected but networks are often hidden or unobserved. Since networks are highly dynamic, changing and growing rapidly, we only observe a relatively small set of cascades before a network changes significantly. Scalable network inference based on a small cascade set is then necessary for understanding the rapidly evolving dynamics that govern diffusion. In this article, we develop a scalable approximation algorithm with provable near-optimal performance based on submodular maximization which achieves a high accuracy in such scenario, solving an open problem first introduced by Gomez-Rodriguez et al (2010). Experiments on synthetic and real diffusion data show that our algorithm in practice achieves an optimal trade-off between accuracy and running time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑