Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs

SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investigate the optimization problem of SimRank similarity computation on undirected web graphs. We first present a novel algorithm to estimate the SimRank between vertices in O n3 + K

• Type: Journal
• Year: 2010
• Where: WAIM
• Authors: Weiren Yu, Xuemin Lin, Jiajin Le
• Keywords: Algorithm, Information Technology, SimRank, SimRank Algorithm, WAIM 2010