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

大规模动态网络中的非参数链路预测

Nonparametric Link Prediction in Large Scale Dynamic Networks

Purnamrita Sarkar, Deepayan Chakrabarti, Michael Jordan

摘要:

本文提出了一种非参数的方法来预测大规模动态网络中的链接。我们的模型使用节点对的基于图的特征以及它们的局部邻域的特征来预测这些节点在每个时间步是否会被链接。该模型允许在图的不同部分进行不同类型的进化(例如,增长或缩小社区)。我们专注于大规模的图形,并提出了我们的模型,利用局部敏感的哈希,使其能够扩展到大的问题的实现。模拟数据以及五个真实世界的动态图的实验表明,我们优于最先进的,特别是当急剧波动或非线性。我们还建立了我们的估计,特别是一致性和弱收敛的理论性质,后者利用斯坦的依赖图的方法的阐述。

英文摘要:

We propose a nonparametric approach to link prediction in large-scale dynamic networks. Our model uses graph-based features of pairs of nodes as well as those of their local neighborhoods to predict whether those nodes will be linked at each time step. The model allows for different types of evolution in different parts of the graph (e.g, growing or shrinking communities). We focus on large-scale graphs and present an implementation of our model that makes use of locality-sensitive hashing to allow it to be scaled to large problems. Experiments with simulated data as well as five real-world dynamic graphs show that we outperform the state of the art, especially when sharp fluctuations or nonlinearities are present. We also establish theoretical properties of our estimator, in particular consistency and weak convergence, the latter making use of an elaboration of Stein's method for dependency graphs.

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

↑