IRWR: incremental random walk with restart

  title={IRWR: incremental random walk with restart},
  author={Weiren Yu and Xuemin Lin},
Random Walk with Restart (RWR) has become an appealing measure of node proximities in emerging applications \eg recommender systems and automatic image captioning. In practice, a real graph is typically large, and is frequently updated with small changes. It is often cost-inhibitive to recompute proximities from scratch via \emph{batch} algorithms when the graph is updated. This paper focuses on the incremental computations of RWR in a dynamic graph, whose edges often change over time. The… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.

Similar Papers

Loading similar papers…