Link Prediction Using Top-k Shortest Distances [chapter]

Andrei Lebedev, JooYoung Lee, Victor Rivera, Manuel Mazzara
2017 Lecture Notes in Computer Science  
In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Our results show that using top-k distances as a similarity measure outperforms classical similarity measures such as Jaccard and Adamic/Adar.
doi:10.1007/978-3-319-60795-5_10 fatcat:jcbubwvhv5cflnwiwh6gxj5t24