Web query recommendation via sequential query prediction

• Main Authors: HE, Qi, JIANG, Daxin, LIAO, Zhen, HOI, Steven C. H., CHANG, Kuiyu, LIM, Ee Peng, LI, Hang
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2009
• Subjects: Query recommendation; Sequential query prediction; Mixture variable memory Markov model; Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/328; https://ink.library.smu.edu.sg/context/sis_research/article/1327/viewcontent/Web_Query_Recommendation_via_Sequential_Query_Pred.pdf
• Institution: Singapore Management University

Web query recommendation has long been considered a key feature of search engines. Building a good Web query recommendation system, however, is very difficult due to the fundamental challenge of predicting users' search intent, especially given the limited user context information. In this paper, we propose a novel "sequential query prediction" approach that tries to grasp a user's search intent based on his/her past query sequence and its resemblance to historical query sequence models mined from massive search engine logs. Different query sequence models were examined, including the naive variable length N-gram model, Variable Memory Markov (VMM) model, and our proposed Mixture Variable Memory Markov (MVMM) model. Extensive experiments were conducted to benchmark our sequence prediction algorithms against two conventional pairwise approaches on large-scale search logs extracted from a commercial search engine. Results show that the sequence-wise approaches significantly outperform the conventional pair-wise ones in terms of prediction accuracy. In particular, our MVMM approach, consistently leads the pack, making it an effective and practical approach towards Web query recommendation.