Link Prediction deals with predicting important non-existent edges in a social network that are likely to occur in the near future. Typically a link between two nodes is predicted if the two nodes have high similarity. Well-known local similarity functions make use of information from all the local neighbors. These functions use the same form irrespective of the degree of the common neighbors. Based on the power law degree distributions that social networks generally follow, we propose non-linear schemes based on monotonically non-increasing functions that give more emphasis to low-degree common nodes than high-degree common nodes. We conducted experiments on several benchmark datasets and observed that the proposed schemes outperform the popular similarity function based methods in terms of accuracy. © Springer-Verlag 2013.
CITATION STYLE
Virinchi, S., & Mitra, P. (2013). Similarity measures for link prediction using power law degree distribution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8227 LNCS, pp. 257–264). https://doi.org/10.1007/978-3-642-42042-9_33
Mendeley helps you to discover research relevant for your work.