Paper

Linear complexity SimRank computation based on the iterative diagonal estimation

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"... (read more)

Results in Papers With Code
(↓ scroll down to see all results)