Paper: CoSimRank: A Flexible & Efficient Graph-Theoretic Similarity Measure

ACL ID P14-1131
Title CoSimRank: A Flexible & Efficient Graph-Theoretic Similarity Measure
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2014
Authors

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 mul- tiplication algorithms to compute CoSim- Rank. Another advantage of CoSimRank is that it can be flexibly extended from ba- sic node-node similarity 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.