ACM Home Page
Please provide us with feedback. Feedback
Optimisation methods for ranking functions with multiple parameters
Full text PdfPdf (351 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the 15th ACM international conference on Information and knowledge management table of contents
Arlington, Virginia, USA
SESSION: Ranking and estimation table of contents
Pages: 585 - 593  
Year of Publication: 2006
ISBN:1-59593-433-2
Authors
Michael Taylor  Microsoft Research, Cambridge, UK
Hugo Zaragoza  Yahoo! Research, Barcelona, Spain
Nick Craswell  Microsoft Research, Cambridge, UK
Stephen Robertson  Microsoft Research, Cambridge, UK
Chris Burges  Microsoft Research, Redmond, WA
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 81,   Citation Count: 9
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/1183614.1183698
What is a DOI?

ABSTRACT

Optimising the parameters of ranking functions with respect to standard IR rank-dependent cost functions has eluded satisfactory analytical treatment. We build on recent advances in alternative differentiable pairwise cost functions, and show that these techniques can be successfully applied to tuning the parameters of an existing family of IR scoring functions (BM25), in the sense that we cannot do better using sensible search heuristics that directly optimize the rank-based cost function NDCG. We also demonstrate how the size of training set affects the number of parameters we can hope to tune this way.


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
4
5
 
6
R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In Advances in Large Margin Classifiers, pages 115--132. MIT Press, 2000.
7
 
8
G. Hullender. Personal communication, 2004.
9
10
 
11
Y. LeCun, L. Bottou, G. B. Orr, and K. R. Müller. Efficient backprop in neural networks: tricks of the trade. Springer, 1998.
12
 
13
D. G. Luenberger. Linear and nonlinear programming. Addison Wesley, 1984.
14
 
15
H. Zaragoza, N. Craswell, M. Taylor, S. Saria, and S. Robertson. Microsoft Cambridge at TREC 2004: Web and HARD track. In E. M. Voorhees and L. P. Buckland, editors, The Thirteenth Text REtrieval Conference, TREC 2004, NIST Special Publication 500-261. Gaithersburg, MD: NIST, 2005.

CITED BY  9

Collaborative Colleagues:
Michael Taylor: colleagues
Hugo Zaragoza: colleagues
Nick Craswell: colleagues
Stephen Robertson: colleagues
Chris Burges: colleagues