A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Link Prediction Using Top-k Shortest Distances
[chapter]
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