A Space and Time Efficient Algorithm for SimRank Computation

SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation paradigm. The most efficient technique has the time complexity O ( n3 ) with the space requirement O ( n2 ) in the worst case for each iteration where n is the number of nodes (web documents). In this paper, we propose novel optimization techniques such that each iteration takes the time O (min {n

• Type: Conference
• Year: 2010
• Where: APWEB
• Authors: Weiren Yu, Xuemin Lin, Jiajin Le
• Keywords: APWEB 2010, Internet Technology, Iteration, Iteration Computation Paradigm, Web Documents