arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.11350cs.SIphysics.soc-ph
收藏

通过控制前导特征向量的链接预测

Link Prediction via controlling the leading eigenvector

Yan-Li Lee, Qiang Dong, Tao Zhou

摘要:

链接预测是网络科学中的一个基本挑战。在众多的方法中,基于相似性的算法以其简单、可解释、高效和良好的性能而备受青睐。在本文中,我们证明了最基本的局部相似性指标共同邻居(CN)可以线性分解的目标网络的邻接矩阵的特征向量,每个特征向量的贡献是成比例的相应特征值的平方。由于在许多真实网络中,最大特征值和第二大特征值之间存在巨大的差距,因此CN索引由前导特征向量主导,并且可能忽略其他特征向量中包含的许多有用信息。因此,我们提出了一个无参数的算法,确保领导的特征向量和次特征向量的贡献相同。在真实网络上的大量实验表明,该算法的预测性能明显优于文献中表现良好的局部相似性指标。进一步提出了一种可以调整前导特征向量贡献的算法,该算法具有较好的精度和较低的计算复杂性,优于现有的参数可调算法。

英文摘要:

Link prediction is a fundamental challenge in network science. Among various methods, similarity-based algorithms are popular for their simplicity, interpretability, high efficiency and good performance. In this paper, we show that the most elementary local similarity index Common Neighbor (CN) can be linearly decomposed by eigenvectors of the adjacency matrix of the target network, with each eigenvector's contribution being proportional to the square of the corresponding eigenvalue. As in many real networks, there is a huge gap between the largest eigenvalue and the second largest eigenvalue, the CN index is thus dominated by the leading eigenvector and much useful information contained in other eigenvectors may be overlooked. Accordingly, we propose a parameter-free algorithm that ensures the contributions of the leading eigenvector and the secondary eigenvector the same. Extensive experiments on real networks demonstrate that the prediction performance of the proposed algorithm is remarkably better than well-performed local similarity indices in the literature. A further proposed algorithm that can adjust the contribution of leading eigenvector shows the superiority over state-of-the-art algorithms with tunable parameters for its competitive accuracy and lower computational complexity.

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

↑