Parallelizing Random Walk with Restart for large-scale query recommendation

  • Chiang M
  • Wang T
  • Peng W
  • 19

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.

Abstract

Random Walk with Restart (abbreviated as RWR) has been widely employed in Web search and recommendation systems and several performance enhancement approaches for RWR have been proposed to save storage costs and improve the on-line response time. In this paper, we explore and implement RWR for query recommendation in Yahoo! Asia Knowledge Plus, which contains a huge amount of Question and Answer Web pages (abbreviated as QA). FromFrom user click logs, we first discover temporal following patterns that indicates frequent QA browsing behaviors of users within a pre-defined time window. In light of temporal following patterns, a graph structure is built for RWR. Since users may submit their queries at the same time, we design a parallel approach for the implementation of RWR in a cloud computing environment. Empirical results on Yahoo! Asia Knowledge Plus dataset demonstrates that our RWR-based recommendation is able to effectively and efficiently recommend related QA Web pages.

Author-supplied keywords

  • parallel computing
  • recommender systems
  • temporal relation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Meng-Fen Chiang

  • Tsung-Wei Wang

  • Wen-Chih Peng

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free