Fast and Exact Top-k Search for Random Walk with Restart

  title={Fast and Exact Top-k Search for Random Walk with Restart},
  author={Yasuhiro Fujiwara and Makoto Nakatsuji and Makoto Onizuka and Masaru Kitsuregawa},
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity score between two nodes in a graph, and it has been successfully used in many applications such as automatic image captioning, recommender systems, and link prediction. The goal of this work is to find nodes that have topk highest proximities for a given node. Previous approaches to this problem find nodes efficiently at… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 94 citations. REVIEW CITATIONS

7 Figures & Tables



Citations per Year

95 Citations

Semantic Scholar estimates that this publication has 95 citations based on the available data.

See our FAQ for additional information.