Towards rich query interpretation: walking back and forth for mining query templates

  • Authors:
  • Ganesh Agarwal;Govind Kabra;Kevin Chen-Chuan Chang

  • Affiliations:
  • University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA;Cazoodle Inc, Champaign, IL, USA;University of Illinois at Urbana-Champaign, Urbana Champaign, IL, USA

  • Venue:
  • Proceedings of the 19th international conference on World wide web
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose to mine structured query templates from search logs, for enabling rich query interpretation that recognizes both query intents and associated attributes. We formalize the notion of template as a sequence of keywords and domain attributes, and our objective is to discover templates with high precision and recall for matching queries in a domain of interest. Our solution bootstraps from small seed input knowledge to discover relevant query templates, by harnessing the wealth of information available in search logs. We model this information in a tri-partite QueST network of queries, sites, and templates. We propose a probabilistic inferencing framework based on the dual metrics of precision and recall- and we show that the dual inferencing correspond respectively to the random walks in backward and forward directions. We deployed and tested our algorithm over a real-world search log of 15 million queries. The algorithm achieved accuracy of as high as 90% (on F-measure), with little seed knowledge and even with incomplete domain schema.