ACM Home Page
Please provide us with feedback. Feedback
Improved query difficulty prediction for the web
Full text PdfPdf (246 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: IR: query analysis table of contents
Pages 439-448  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Claudia Hauff  University of Twente, Enschede, Netherlands
Vanessa Murdock  Yahoo! Research - Barcelona, Barcelona, Spain
Ricardo Baeza-Yates  Yahoo! Research - Barcelona, Barcelona, Spain
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 233,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458142
What is a DOI?

ABSTRACT

Query performance prediction aims to predict whether a query will have a high average precision given retrieval from a particular collection, or low average precision. An accurate estimator of the quality of search engine results can allow the search engine to decide to which queries to apply query expansion, for which queries to suggest alternative search terms, to adjust the sponsored results, or to return results from specialized collections. In this paper we present an evaluation of state of the art query prediction algorithms, both post-retrieval and pre-retrieval and we analyze their sensitivity towards the retrieval algorithm. We evaluate query difficulty predictors over three widely different collections and query sets and present an analysis of why prediction algorithms perform significantly worse on Web data. Finally we introduce Improved Clarity, and demonstrate that it outperforms state-of-the-art predictors on three standard collections, including two large Web collections.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
G. Amati, C. Carpineto, and G. Romano. Query difficulty, robustness and selective application of query expansion. In Proceedings of the 25th European Conference on Information Retrieval, pages 127--137, 2004.
 
2
J. A. Aslam and V. Pavlu. Query hardness estimation using Jensen-Shannon divergence among multiple scoring functions. In Advances in Information Retrieval: 28th European Conference on IR Research, pages 198--209, 2007.
 
3
C. Clarke, N. Craswell, and I. Soboroff. Overview of the trec 2004 terabyte track. In Proceedings of the Thirteenth Text REtrieval Conference, 2004.
4
5
 
6
B. He and I. Ounis. Inferring query performance using pre-retrieval predictors. In The Eleventh Symposium on String Processing and Information Retrieval (SPIRE), pages 43--54, 2004.
7
8
9
10
11
12
13
14
15
16
17

Collaborative Colleagues:
Claudia Hauff: colleagues
Vanessa Murdock: colleagues
Ricardo Baeza-Yates: colleagues