Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2623330.2623696 | knowledge discovery and data mining |
Field | DocType | Volume |
Computational Technique,Linear equation,Discrete mathematics,Combinatorics,Similarity measure,Theoretical computer science,SimRank,Mathematics,Linearization,Computation | Journal | abs/1411.7228 |
Citations | PageRank | References |
10 | 0.49 | 26 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takanori Maehara | 1 | 10 | 1.50 |
| Mitsuru Kusumoto | 2 | 10 | 0.49 |
| Ken-ichi Kawarabayashi | 3 | 1731 | 149.16 |