A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 ofdoi:10.1007/978-3-642-14246-8_29 fatcat:sgjuysmvurgbhpqsaju5pbsvqa