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 application/pdf
.
Fast computation of SimRank for static and dynamic information networks
2010
Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important aspects of information network analysis is to measure similarity between nodes in a network. SimRank is a simple and influential measure of this kind, based on a solid theoretical "random surfer" model. Existing work computes SimRank similarity scores in an iterative mode. We argue that the iterative method can be
doi:10.1145/1739041.1739098
dblp:conf/edbt/LiHHJSYW10
fatcat:5v7j5k5cizbdxcg2ucebacutre