A space and time efficient algorithm for SimRank computation

Weiren Yu, Wenjie Zhang, Xuemin Lin, Qing Zhang, Jiajin Le
2010 World wide web (Bussum)  
SimRank has become an important similarity measure to rank web documents based on a graph model on hyperlinks. The existing approaches for conducting SimRank computation adopt an iteration paradigm. The most efficient deterministic technique yields O n 3 worst-case time per iteration with the space requirement O n 2 , where n is the number of nodes (web documents). In this paper, we propose novel optimization techniques such that each iteration takes O (min {n · m, n r }) time and O (n + m)
more » ... e, where m is the number of edges in a web-graph model and r ≤ log 2 7. In addition, we extend the similarity transition matrix to prevent random surfers getting stuck, and devise a pruning technique to eliminate impractical similarities for each iteration. Moreover, we also develop a reordering technique combined with an over-relaxation method, not only speeding up the convergence rate of the existing techniques, but achieving I/O efficiency as well.
doi:10.1007/s11280-010-0100-6 fatcat:pirquc2zkfbbbjpkze6yj4ltke