Linear complexity SimRank computation based on the iterative diagonal estimation

Author name not available (Why is that?)

Publication date: 25 February 2015

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.

Has companion code repository: https://github.com/ovgeorge/simrank-ide

This page was built for publication: Linear complexity SimRank computation based on the iterative diagonal estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6259404)