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

潜在社会网络推理的凸性研究

On the Convexity of Latent Social Network Inference

Seth A. Myers, Jure Leskovec

摘要:

在许多现实世界中,几乎不可能收集明确的社交网络数据。在这种情况下,整个网络必须从基础观测中推断出来。在这里,我们制定的问题,推断潜在的社交网络的基础上网络扩散或疾病传播数据。我们考虑传染在未观察到的社交网络的边缘传播,在那里我们只观察节点被感染的时间,但不观察谁感染了它们。给定这样的节点感染时间,我们然后确定最能解释观测数据的最佳网络。我们提出了一个最大似然方法的基础上凸规划的l1-like惩罚项,鼓励稀疏。对真实数据和合成数据的实验表明,我们的方法几乎完美地恢复了底层网络结构以及传染传播模型的参数。此外,我们的方法可扩展性很好,因为它可以在几分钟内推断出数千个节点的最佳网络。

英文摘要:

In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, we formulate the problem of inferring latent social networks based on network diffusion or disease propagation data. We consider contagions propagating over the edges of an unobserved social network, where we only observe the times when nodes became infected, but not who infected them. Given such node infection times, we then identify the optimal network that best explains the observed data. We present a maximum likelihood approach based on convex programming with a l1-like penalty term that encourages sparsity. Experiments on real and synthetic data reveal that our method near-perfectly recovers the underlying network structure as well as the parameters of the contagion propagation model. Moreover, our approach scales well as it can infer optimal networks of thousands of nodes in a matter of minutes.

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

↑