arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.6394cs.LGcs.SIstat.ML
收藏

动态网络中非参数链接预测

Nonparametric Link Prediction in Dynamic Networks

University of California, Berkeley(加利福尼亚大学伯克利分校);Facebook(脸书公司);Yahoo! Research(雅虎研究院)

Purnamrita Sarkar, Deepayan Chakrabarti, Michael Jordan

摘要:

我们提出了一个非参数的链接预测算法的序列图快照随时间的推移。该模型基于其端点的特征以及端点周围的局部邻域的特征来预测链接。这允许图中有不同类型的社区,每个社区都有自己的动态(例如,增长或缩小社区)。我们证明了我们的估计的一致性,并给出了一个快速实现基于局部敏感哈希。模拟以及五个真实世界的动态图的实验表明,我们优于最先进的,特别是当急剧波动或非线性存在。

英文摘要:

We propose a non-parametric link prediction algorithm for a sequence of graph snapshots over time. The model predicts links based on the features of its endpoints, as well as those of the local neighborhood around the endpoints. This allows for different types of neighborhoods in a graph, each with its own dynamics (e.g, growing or shrinking communities). We prove the consistency of our estimator, and give a fast implementation based on locality-sensitive hashing. Experiments with simulated as well as five real-world dynamic graphs show that we outperform the state of the art, especially when sharp fluctuations or non-linearities are present.

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

↑