A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We present CoSimRank, a graph-theoretic similarity measure that is efficient because it can compute a single node similarity without having to compute the similarities of the entire graph. We present equivalent formalizations that show CoSimRank's close relationship to Personalized Page-Rank and SimRank and also show how we can take advantage of fast matrix multiplication algorithms to compute CoSim-Rank. Another advantage of CoSimRank is that it can be flexibly extended from basic node-nodedoi:10.3115/v1/p14-1131 dblp:conf/acl/RotheS14 fatcat:xrujeahimfefba5lg2q5nktcvi