Learning to estimate query difficulty
Authors:
Open Access
- 15 August 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 512-519
Abstract
In this article we present novel learning methods for estimating the quality of results returned by a search engine in response to a query. Estimation is based on the agreement between the top results of the full query and the top results of its sub-queries. We demonstrate the usefulness of quality estimation for several applications, among them improvement of retrieval, detecting queries for which no relevant content exists in the document collection, and distributed information retrieval. Experiments on TREC data demonstrate the robustness and the effectiveness of our learning algorithms.Keywords
This publication has 10 references indexed in Scilit:
- Why current IR engines fail2004
- The NRRC reliable information access (RIA) workshop2004
- Using temporal profiles of queries for precision prediction2004
- Query Difficulty, Robustness, and Selective Application of Query Expansion2004
- Predicting query performance2002
- Automatic query wefinement using lexical affinities with maximal information gain2002
- Optimizing search engines using clickthrough data2002
- Random ForestsMachine Learning, 2001
- Cluster-based language models for distributed retrieval1999
- Searching distributed collections with inference networks1995