Linear complexity SimRank computation based on the iterative diagonal estimation
Data Structures and Algorithms
2015-02-26 v1 Numerical Analysis
Numerical Analysis
Abstract
This paper presents a deterministic linear time complexity IDE-SimRank method to approximately compute SimRank with proved error bound. SimRank is a well-known similarity measure between graph vertices which relies on graph topology only and is built on intuition that "two objects are similar if they are related to similar objects". The fixed point equation for direct SimRank computation is the discrete Lyapunov equation with specific diagonal matrix in the right hand side. The proposed method is based on estimation of this diagonal matrix with GMRES and use this estimation to compute singe-source and single pairs queries. These computations are executed with the part of series converging to the discrete Lyapunov equation solution.
Keywords
Cite
@article{arxiv.1502.07167,
title = {Linear complexity SimRank computation based on the iterative diagonal estimation},
author = {I. V. Oseledets and G. V. Ovchinnikov and A. M. Katrutsa},
journal= {arXiv preprint arXiv:1502.07167},
year = {2015}
}