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

信息级联的底层结构推断

Inferring the Underlying Structure of Information Cascades

University of California at Santa Barbara(加州大学圣巴巴拉分校)

Bo Zong, Yinghui Wu, Ambuj K. Singh, Xifeng Yan

摘要:

在社交网络中,信息和影响力在用户之间以级联的方式传播。虽然研究叶栅的重要性已在各种应用中得到承认,但在实践中很难观察叶栅的完整结构。此外,关于如何根据部分观测推断级联,人们所知甚少。本文研究了独立级联模型下的级联推理问题,从复杂度到算法都进行了全面的论述:(a)提出了一致树作为级联推理结构的思想,这些树将源节点和观测节点连接起来,路径满足观测时间信息的约束。(b)我们引入指标来衡量的可能性一致的树推断级联,以及几个优化问题,找到他们。(c)我们表明,一致树的决策问题一般是NP-完全的,优化问题是很难近似的。(d)我们提供的近似算法的推断级联的质量,以及questionistics的性能保证。我们实验验证了我们的推理算法的效率和有效性,使用真实和合成数据。

英文摘要:

In social networks, information and influence diffuse among users as cascades. While the importance of studying cascades has been recognized in various applications, it is difficult to observe the complete structure of cascades in practice. Moreover, much less is known on how to infer cascades based on partial observations. In this paper we study the cascade inference problem following the independent cascade model, and provide a full treatment from complexity to algorithms: (a) We propose the idea of consistent trees as the inferred structures for cascades; these trees connect source nodes and observed nodes with paths satisfying the constraints from the observed temporal information. (b) We introduce metrics to measure the likelihood of consistent trees as inferred cascades, as well as several optimization problems for finding them. (c) We show that the decision problems for consistent trees are in general NP-complete, and that the optimization problems are hard to approximate. (d) We provide approximation algorithms with performance guarantees on the quality of the inferred cascades, as well as heuristics. We experimentally verify the efficiency and effectiveness of our inference algorithms, using real and synthetic data.

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

↑