Predicting missing links via local information

From MaRDI portal
Publication:148014

DOI10.1140/EPJB/E2009-00335-8zbMATH Open1188.05143arXiv0901.0553OpenAlexW2007444087MaRDI QIDQ148014FDOQ148014

Linyuan Lu, Tao Zhou, Yi-Cheng Zhang, Yi-Cheng Zhang, Tao Zhou, Linyuan Lü

Publication date: October 2009

Published in: The European Physical Journal B, The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Abstract: Missing link prediction of networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate a simple framework of link prediction on the basis of node similarity. We compare nine well-known local similarity measures on six real networks. The results indicate that the simplest measure, namely common neighbors, has the best overall performance, and the Adamic-Adar index performs the second best. A new similarity measure, motivated by the resource allocation process taking place on networks, is proposed and shown to have higher prediction accuracy than common neighbors. It is found that many links are assigned same scores if only the information of the nearest neighbors is used. We therefore design another new measure exploited information of the next nearest neighbors, which can remarkably enhance the prediction accuracy.


Full work available at URL: https://arxiv.org/abs/0901.0553





Cites Work


Cited In (73)

Uses Software






This page was built for publication: Predicting missing links via local information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q148014)