ACM Home Page
Please provide us with feedback. Feedback
High accuracy retrieval with multiple nested ranker
Full text PdfPdf (344 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Seattle, Washington, USA
SESSION: The first page of results table of contents
Pages: 437 - 444  
Year of Publication: 2006
ISBN:1-59593-369-7
Authors
Irina Matveeva  University of Chicago, Chicago, IL
Chris Burges  Microsoft Research, Redmond, WA
Timo Burkard  MSN Search, Redmond, WA
Andy Laucius  Microsoft Research, Redmond, WA
Leon Wong  Microsoft Research, Redmond, WA
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 75,   Citation Count: 10
Additional Information:

abstract   references   cited by   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/1148170.1148246
What is a DOI?

ABSTRACT

High precision at the top ranks has become a new focus of research in information retrieval. This paper presents the multiple nested ranker approach that improves the accuracy at the top ranks by iteratively re-ranking the top scoring documents. At each iteration, this approach uses the RankNet learning algorithm to re-rank a subset of the results. This splits the problem into smaller and easier tasks and generates a new distribution of the results to be learned by the algorithm. We evaluate this approach using different settings on a data set labeled with several degrees of relevance. We use the normalized discounted cumulative gain (NDCG) to measure the performance because it depends not only on the position but also on the relevance score of the document in the ranked list. Our experiments show that making the learning algorithm concentrate on the top scoring results improves precision at the top ten documents in terms of the NDCG score.


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
E. B. Baum and F. Wilczek. Supervised learning of probability distributions by neural networks. Neural Information Processing Systems, pages 52--61, 1987.
2
 
3
 
4
 
5
D. He and D. Demner-Fushman. HARD experiment at Maryland: From need negotiation to automated HARD process. In Proceedings of TREC, 2003.
 
6
X. He and P. Niyogi. Locality preserving projections. In Proceedings of NIPS, 2003.
 
7
A. James. HARD track overview in TREC 2003. In Proceedings of TREC, 2003.
 
8
A. James. HARD track overview in TREC 2004. In Proceedings of TREC, 2004.
 
9
B. J. Jansen and A. Spink. An analysis of web documents retrieved and viewed. In Proceedings of the International Conference on Internet Computing, pages 65--69, 2003.
 
10
B. J. Jansen, A. Spink, J. Bateman, and T. Saracevic. Real life information retrieval: A study of user queries on the web. In Proceedings of SIGIR, pages 5--17, 1998.
11
12
 
13
 
14
G. Levow and I. Matveeva. University of Chicago at CLEF2004: Cross-language text and spoken document retrieval. In Proceedings of CLEF, 2004.
 
15
 
16
J. Ponte. Language models for relevance feedback. In W. Croft, editor, Advances in Information Retrieval, pages 73--96, 2000.
 
17
J. J. Roccio. Relevance feedback in information retrieval. In The SMART Retrieval System: Experiments in Automatic Document Processing, pages 313--323. Prentice Hall, 1971.
18
 
19
20
 
21
Y. Xiao, R. Luk, K. Wong, and K. Kwok. Some experiments with blind feedback and re-ranking for chinese information retrieval. In Proceedings NTCIR, 2005.

CITED BY  10

Collaborative Colleagues:
Irina Matveeva: colleagues
Chris Burges: colleagues
Timo Burkard: colleagues
Andy Laucius: colleagues
Leon Wong: colleagues