ACM Home Page
Please provide us with feedback. Feedback
A support vector method for optimizing average precision
Full text PdfPdf (278 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Amsterdam, The Netherlands
SESSION: Learning to rank I table of contents
Pages: 271 - 278  
Year of Publication: 2007
ISBN:978-1-59593-597-7
Authors
Yisong Yue  Cornell University
Thomas Finley  Cornell University
Filip Radlinski  Cornell University
Thorsten Joachims  Cornell University
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 27
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/1277741.1277790
What is a DOI?

ABSTRACT

Machine learning is commonly used to improve ranked retrieval systems. Due to computational difficulties, few learning techniques have been developed to directly optimize for mean average precision (MAP), despite its widespread use in evaluating such systems. Existing approaches optimizing MAP either do not find a globally optimal solution, or are computationally expensive. In contrast, we present a general SVM learning algorithm that efficiently finds a globally optimal solution to a straightforward relaxation of MAP. We evaluate our approach using the TREC 9 and TREC 10 Web Track corpora (WT10g), comparing against SVMs optimized for accuracy and ROCArea. In most cases we show our method to produce statistically significant improvements in MAP scores.


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
2
 
3
C. J. C. Burges, R. Ragno, and Q. Le. Learning to rank with non-smooth cost functions. In Proceedings of the International Conference on Advances in Neural Information Processing Systems (NIPS), 2006.
4
5
6
7
 
8
D. Hawking. Overview of the TREC-9 web track. 2000.
 
9
D. Hawking and N. Craswell. Overview of the TREC-2001 web track. Nov. 2001.
 
10
11
12
13
14
 
15
16
 
17
 
18
S. Robertson. The probability ranking principle in ir. journal of documentation. Journal of Documentation, 33(4):294--304, 1977.
 
19
 
20
 
21
L. Yan, R. Dodier, M. Mozer, and R. Wolniewicz. Optimizing classifier performance via approximation to the Wilcoxon-Mann-Witney statistic. In Proceedings of the International Conference on Machine Learning (ICML), 2003.

CITED BY  28

Collaborative Colleagues:
Yisong Yue: colleagues
Thomas Finley: colleagues
Filip Radlinski: colleagues
Thorsten Joachims: colleagues