A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
SimRank is an attractive structural-context measure of similarity between two objects in a graph. It recursively follows the intuition that "two objects are similar if they are referenced by similar objects". The best known matrix-based method  for calculating SimRank, however, implies an assumption that the graph is non-singular, i.e., its adjacency matrix is invertible. In reality, non-singular graphs are very rare; such an assumption in  is too restrictive in practice. In this paper,doi:10.1145/2600428.2609459 dblp:conf/sigir/YuM14 fatcat:d4sgjqtuy5aijj7o3tzznfnaey