Name
Abstract | ||
|---|---|---|
SimRank is a well-known similarity measure between graph vertices. This measure relies on a graph topology and is built on the intuition that ‘two objects are similar if they are related to similar objects’. Formalization of this intuition leads to a system of linear equations, so large that even the solution vector will not fit in the RAM for many real-world graphs. To solve this issue we propose... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1093/comnet/cnw008 | Journal of Complex Networks |
Keywords | Field | DocType |
Link Analysis,Similarity Search,SimRank,Lyapunov equation,svd,probabilistic svd | Discrete mathematics,Theoretical computer science,Low-rank approximation,Mathematics,SimRank | Journal |
Volume | Issue | ISSN |
5 | 1 | 2051-1310 |
Citations | PageRank | References |
1 | 0.35 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan V. Oseledets | 1 | 306 | 41.96 |
| G. V. Ovchinnikov | 2 | 1 | 0.35 |
| A. M. Katrutsa | 3 | 10 | 2.54 |