Reducing long queries using query quality predictors
Authors:
Open Access
- 19 July 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 564-571
Abstract
Long queries frequently contain many extraneous terms that hinder retrieval of relevant documents. We present techniques to reduce long queries to more effective shorter ones that lack those extraneous terms. Our work is motivated by the observation that perfectly reducing long TREC description queries can lead to an average improvement of 30% in mean average precision. Our approach involves transforming the reduction problem into a problem of learning to rank all sub-sets of the original query (sub-queries) based on their predicted quality, and selecting the top sub-query. We use various measures of query quality described in the literature as features to represent sub-queries, and train a classifier. Replacing the original long query with the top-ranked sub-query chosen by the ranker results in a statistically significant average improvement of 8% on our test sets. Analysis of the results shows that query reduction is well-suited for moderately-performing long queries, and a small set of query quality predictors are well-suited for the task of ranking sub-queries.Keywords
This publication has 19 references indexed in Scilit:
- Regression Rank: Learning to Meet the Opportunity of Descriptive Queries2009
- Using web-graph distance for relevance feedback in web search2006
- Optimisation methods for ranking functions with multiple parameters2006
- Ranking robustness2006
- Incorporating non-local information into information extraction systems by Gibbs sampling2005
- A study of smoothing methods for language models applied to information retrievalACM Transactions on Information Systems, 2004
- Inferring Query Performance Using Pre-retrieval Predictors2004
- Predicting query performance2002
- Optimizing search engines using clickthrough data2002
- TREC and TIPSTER experiments with inqueryInformation Processing & Management, 1995