Journal article

Predicting missing links via correlation between nodes

  • Liao, Hao Alibaba Research Center for Complexity Sciences, Hangzhou Normal University, China - Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China
  • Zeng, An Alibaba Research Center for Complexity Sciences, Hangzhou Normal University, China - School of Systems Science, Beijing Normal University, China
  • Zhang, Yi-Cheng Department of Physics, University of Fribourg, Switzerland - School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, PR China
Published in:
  • Physica A: Statistical Mechanics and its Applications. - 2015, vol. 436, p. 216–223
English As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has been intensively investigated recently and many methods have been proposed so far. The essential challenge of link prediction is to estimate the similarity between nodes. Most of the existing methods are based on the common neighbor index and its variants. In this paper, we propose to calculate the similarity between nodes by the Pearson correlation coefficient. This method is found to be very effective when applied to calculate similarity based on high order paths. We finally fuse the correlation-based method with the resource allocation method, and find that the combined method can substantially outperform the existing methods, especially in sparse networks.
Faculté des sciences et de médecine
Département de Physique
  • English
License undefined
Persistent URL

Document views: 36 File downloads:
  • zha_pml.pdf: 73