CoSimRank: A Flexible and Efficient Graph-Theoretic Similarity Measure

Sascha Rothe, Hinrich Schütze
2014 Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)  
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-node
more » ... ilarity to several other graph-theoretic similarity measures. In an experimental evaluation on the tasks of synonym extraction and bilingual lexicon extraction, CoSimRank is faster or more accurate than previous approaches.
doi:10.3115/v1/p14-1131 dblp:conf/acl/RotheS14 fatcat:xrujeahimfefba5lg2q5nktcvi