A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Scaling link-based similarity search
2005
Proceedings of the 14th international conference on World Wide Web - WWW '05
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed architecture. The similarity of multi-step neighborhoods of vertices are numerically evaluated by similarity functions including SimRank [20], a recursive refinement of cocitation; PSimRank, a novel variant with better theoretical characteristics; and the Jaccard coefficient, extended to multi-step neighborhoods. Our
doi:10.1145/1060745.1060839
dblp:conf/www/FogarasR05
fatcat:4i2242pw2rd53lrsr4q7i3l5wm