arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.08586cs.SI
收藏

从时间观测重建级联

Reconstructing a cascade from temporal observations

Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis

摘要:

给定一个网络中活跃节点的子集,我们能否重建产生这些观测的级联?这是一个已经在文献中研究过的问题,但在这里,我们关注的情况下,时间信息是可用的活动节点。特别地,我们假设除了活动节点的子集之外,我们还知道它们的激活时间。我们制定这个级联重建问题作为一个变种的Steiner树问题:我们要求找到一棵树,跨越所有报告的活动节点,同时满足时间一致性约束。我们提出了三种近似算法。在质量方面最好的算法实现了O(\sqrt{k})近似保证,其中k是活动节点的数量,而最有效的算法具有线性的运行时间,使其可扩展到非常大的图。我们评估我们的算法在现实世界的网络与模拟和真实的级联。我们的研究结果表明,利用现有的时间信息,可以更准确的级联重建。此外,我们的目标是找到级联的“骨干”,它给出了高精度的解决方案。

英文摘要:

Given a subset of active nodes in a network can we re- construct the cascade that has generated these observa- tions? This is a problem that has been studied in the literature, but here we focus in the case that tempo- ral information is available about the active nodes. In particular, we assume that in addition to the subset of active nodes we also know their activation time. We formulate this cascade-reconstruction problem as a variant of a Steiner-tree problem: we ask to find a tree that spans all reported active nodes while satisfying temporal-consistency constraints. We present three approximation algorithms. The best algorithm in terms of quality achieves a O(\sqrt{k})-approximation guarantee, where k is the number of active nodes, while the most efficient algorithm has linearithmic running time, making it scalable to very large graphs. We evaluate our algorithms on real-world networks with both simulated and real cascades. Our results in- dicate that utilizing the available temporal information allows for more accurate cascade reconstruction. Fur- thermore, our objective leads to finding the "backbone" of the cascade and it gives solutions of high precision.

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

↑