Learning to rank with multiple objective functions

Proceedings of the 20th International Conference on World Wide Web, WWW 2011

Volumn , Issue , 2011, Pages 367-376

  Svore, Krysta M ^a   Volkovs, Maksims N ^b   Burges, Christopher J C ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Learning to rank; Relevance measures; Web search

Indexed keywords

DOCUMENT RETRIEVAL; EARLY LEARNING; LEARNING TO RANK; MULTIPLE OBJECTIVE FUNCTIONS; RANKING ALGORITHM; RANKING MODEL; RELEVANCE MEASURE; WEB SEARCHES;

COST BENEFIT ANALYSIS; COST FUNCTIONS; WORLD WIDE WEB;

INFORMATION RETRIEVAL;

EID: 80052661691     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1963405.1963459     Document Type: Conference Paper

References (19)

1. E. Agichtein, E. Brill, and S. Dumais. Improving web search ranking by incorporating user behavior information. In Proceedings of international ACM SIGIR conference on Research and development in information retrieval, pages 19-26, 2006.
2. C. J. Burges, K. M. Svore, P. N. Benett, A. Pastusiak, and Q. Wu. Learning to rank using an ensemble of lambda-gradient models. to appear in Special Edition of JMLR: Proceedings of the Yahoo! Learning to Rank Challenge, 14:25-35, 2011.
3. C. J. C. Burges. From RankNet to LambdaRank to LambdaMART: An Overview. Technical Report MSR-TR-2010-82, Microsoft Research, 2010.
4. C. J. C. Burges, R. Ragno, and Q. V. Le. Learning to rank with nonsmooth cost functions. In Proceedings of the Neural Information Processing Systems, pages 193-200, 2006.
5. C. J. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In Proceedings of the International Conference on Machine learning, pages 89-96, 2005.
6. Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: from pairwise approach to listwise approach. In Proceedings of the International Conference on Machine learning, pages 129-136, 2007.
7. S. Chakrabarti, R. Khanna, U. Sawant, and C. Bhattacharyya. Structured learning for non-smooth ranking losses. In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 88-96, 2008.
8. O. Chapelle, Y. Chang, and T.-Y. Liu. The Yahoo! Learning to Rank Challenge, 2010.
9. P. Donmez, K. Svore, and C. Burges. On the local optimality of lambdarank. In Special Interest Group on Information Retrieval (SIGIR), 2009.
10. Z. Dou, R. Song, X. Yuan, and J.-R. Wen. Are click-through data adequate for learning web search rankings? In Proceeding of the ACM Conference on Information and Knowledge Management, 2008.
11. J. H. Friedman. Greedy function approximation: A gradient boosting machine. In Annals of Statistics, pages 29(5):1189-1232, 2001.
12. F. Guo, C. Liu, A. Kannan, T. Minka, M. Taylor, Y.-M. Wang, and C. Faloutsos. Click chain model in web search. In Proceedings of the 18th International World Wide Web Conference. Association for Computing Machinery, Inc., 2009.
13. K. Jarvelin and J. Kekalainen. IR evaluation methods for retrieving highly relevant documents. In Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 41-48, 2000.
14. T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, pages 133-142, 2002.
15. T. Joachims, L. Granka, B. Pan, H. Hembrooke, F. Radlinski, and G. Gay. Evaluating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Transactions on Information Science, 2007.
16. O.Chapelle, D. Metzler, Y. Zhang, and P. Grinspan. Expected reciprocal rank for graded relevance. In Proceeding of the ACM Conference on Information and Knowledge Management, 2009.
17. M. Taylor, J. Guiver, S. Robertson, and T. Minka. Softrank: optimizing non-smooth rank metrics. In Proceedings of the International Conference on Web Search and Web Data Mining, pages 77-86, 2008.
18. M. N. Volkovs and R. S. Zemel. Boltzrank: Learning to maximize expected ranking gain. In Proceedings of the International Conference on Machine Learning, pages 1089-1096, 2009.
19. Q. Wu, C. Burges, K. M. Svore, and J. Gao. Adapting Boosting for Information Retrieval Measures. Information Retrieval, 2009.