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

Weiren Yu, Xuemin Lin, Jiajin Le
2010 Lecture Notes in Computer Science  
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 Sim-Rank similarity computation on undirected web graphs. We first present a novel algorithm to estimate the SimRank between vertices in O n 3 + K · n 2 time, where n is the number of vertices, and K is the number of iterations. In comparison, the most efficient implementation of
more » ... k algorithm in [1] takes O K · n 3 time in the worst case. To efficiently handle large-scale computations, we also propose a parallel implementation of the SimRank algorithm on multiple processors. The experimental evaluations on both synthetic and real-life data sets demonstrate the better computational time and parallel efficiency of our proposed techniques.
doi:10.1007/978-3-642-14246-8_29 fatcat:sgjuysmvurgbhpqsaju5pbsvqa