Predicting missing links via significant paths
arXiv:1402.6225 · doi:10.1209/0295-5075/106/18008
Abstract
Link prediction plays an important role in understanding intrinsic evolving mechanisms of networks. With the belief that the likelihood of the existence of a link between two nodes is strongly related with their similarity, many methods have been proposed to calculate node similarity based on node attributes and/or topological structures. Among a large variety of methods that take into account paths connecting the target pair of nodes, most of which neglect the heterogeneity of those paths. Our hypothesis is that a path consisting of small-degree nodes provides a strong evidence of similarity between two ends, accordingly, we propose a so-called sig- nificant path index in this Letter to leverage intermediate nodes' degrees in similarity calculation. Empirical experiments on twelve disparate real networks demonstrate that the proposed index outperforms the mainstream link prediction baselines.
6 pages, 2 figures
References in corpus (11)
- Finding community structure in networks using the eigenvectors of matrices
- Predicting Missing Links via Local Information
- Community Structure in Jazz
- Recommender Systems
- What's in a crowd? Analysis of face-to-face behavioral networks
- Missing and spurious interactions and the reconstruction of complex networks
- Effective and Efficient Similarity Index for Link Prediction of Complex Networks
- Efficient routing on complex networks
- Power-law Strength-Degree Correlation From a Resource-Allocation Dynamics on Weighted Networks
- Potential Theory for Directed Networks
- Self-similar scaling of density in complex real-world networks