Efficient SimRank Computation via Linearization
Data Structures and Algorithms
2014-11-27 v1
Abstract
SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for computing SimRank, their computational costs are very high. In this paper, we propose a new computational technique, "SimRank linearization," for computing SimRank, which converts the SimRank problem to a linear equation problem. By using this technique, we can solve many SimRank problems, such as single-pair compuation, single-source computation, all-pairs computation, top k searching, and similarity join problems, efficiently.
Cite
@article{arxiv.1411.7228,
title = {Efficient SimRank Computation via Linearization},
author = {Takanori Maehara and Mitsuru Kusumoto and Ken-ichi Kawarabayashi},
journal= {arXiv preprint arXiv:1411.7228},
year = {2014}
}
Comments
46 pages, journal version of our papers appeared in SIGMOD14 and ICDE15