|
|
|
     |
                                         |
Return to Web search 3
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.
@inproceedings{1076121, author = {Elad Yom-Tov and Shai Fine and David Carmel and Adam Darlow}, title = {Learning to estimate query difficulty: including applications to missing content detection and distributed information retrieval}, booktitle = {SIGIR '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval}, year = {2005}, isbn = {1-59593-034-5}, pages = {512--519}, location = {Salvador, Brazil}, doi = {http://doi.acm.org/10.1145/1076034.1076121}, publisher = {ACM Press}, address = {New York, NY, USA}, }  ©2006 Association for Computing Machinery |
