2009/01/31 by Tao Zhou, Linyuan Lu, Yi-Cheng Zhang · 2 citations
Physics and Astronomy · #physics.data-an #physics.soc-ph
paper · pdf · doi:10.1140/epjb/e2009-00335-8
published as Eur. Phys. J. B 71 (2009) 623-630 · For International Workshop: "The Physics Approach To Risk: Agent-Based Models and Networks", http://intern.sg.ethz.ch/cost-p10/
arxiv created 2009/06/01 · arxiv updated 2009/12/01
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.