Active learning for ranking through expected loss optimization

SIGIR 2010 Proceedings - 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

Volumn , Issue , 2010, Pages 267-274

  Long, Bo ^a   Chapelle, Olivier ^a   Zhang, Ya ^b   Chang, Yi ^a   Zheng, Zhaohui ^a   Tseng, Belle ^a  

^a YAHOO RESEARCH   (United States)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Active learning; Expected Loss Optimization; Ranking

Indexed keywords

ACTIVE LEARNING; DATA SETS; DOCUMENT SELECTION; EXPECTED LOSS OPTIMIZATION; FRAMEWORK AND ALGORITHMS; LEARNING TO RANK; NOVEL ALGORITHM; ONLINE ADVERTISING; RANKING; RANKING FUNCTIONS; RANKING MODEL; REAL-WORLD; RECOMMENDATION SYSTEMS; RETRIEVAL APPLICATIONS; TRAINING DATA; TRAINING SETS; TWO STAGE; WEB SEARCH ENGINES; WEB SEARCHES;

ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; SEARCH ENGINES; WORLD WIDE WEB;

INFORMATION RETRIEVAL;

EID: 77956039703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835449.1835495     Document Type: Conference Paper

References (26)

1. N. Abe and H. Mamitsuka. Query learning strategies using boosting and bagging. In Proceedings of the Fifteenth International Conference on Machine Learning. Morgan Kaufmann Publishers Inc., 1998.
2. J. A. Aslam, E. Kanoulas, V. Pavlu, S. Savev, and E. Yilmaz. Document selection methodologies for efficient and effective learning-to-rank. In SIGIR '09: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 468-475. ACM, 2009.
3. J. Berger. Statistical decision theory and Bayesian analysis. Springer, 1985.
4. C. Campbell, N. Cristianini, and A. Smola. Query learning with large margin classifiers. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 111-118. Morgan Kaufmann, 2000.
5. B. Carterette, J. Allan, and R. Sitaraman. Minimal test collections for retrieval evaluation. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 2006.
6. W. Chu and Z. Ghahramani. Extensions of gaussian processes for ranking: semi-supervised and active learning. In Nips workshop on Learning to Rank, 2005.
7. D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active learning with statistical models. In G. Tesauro, D. Touretzky, and T. Leen, editors, Advances in Neural Information Processing Systems, volume 7, pages 705-712. The MIT Press, 1995.
8. D. Cossock and T. Zhang. Subset ranking using regression. In Proc. Conf. on Learning Theory, 2006.
9. I. Dagan and S. P. Engelson. Committee-based sampling for training probabilistic classifiers. In In Proceedings of the Twelfth International Conference on Machine Learning, pages 150-157. Morgan Kaufmann, 1995.
10. P. Donmez and J. Carbonell. Active sampling for rank learning via optimizing the area under the ROC curve. In Proceedings of the 31th European Conference on IR Research on Advances in Information Retrieval, pages 78-89, 2009.
11. P. Donmez and J. G. Carbonell. Optimizing estimated loss reduction for active sampling in rank learning. In ICML '08: Proceedings of the 25th international conference on Machine learning, pages 248-255, New York, NY, USA, 2008. ACM.
12. V. Fedorov. Theory of Optimal Experiments. Academic Press, New York, 1972.
13. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
14. Y. Freund, H. S. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168, 1997.
15. J. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, pages 1189-1232, 2001.
16. T. Fushiki. Bootstrap prediction and bayesian prediction under misspecified models. Bernoulli, 11(4):747-758, 2005.
17. R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In Smola, Bartlett, Schoelkopf, and Schuurmans, editors, Advances in Large Margin Classifiers. MIT Press, Cambridge, MA, 2000.
18. D. Lewis and W. Gale. Training text classifiers by uncertainty sampling. In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 3-12, 1994.
19. A. McCallum and K. Nigam. Employing EM and pool-based active learning for text classification. In Proceedings of the 5th international conference on Machine learning, pages 359-367, 1998.
20. B. Settles. Active learning literature survey. Technical Report Computer Sciences 1648, University of Wisconsin, Madison, 2009.
21. F. Xia, T.-Y. Liu, J. Wang, W. Zhang, and H. Li. Listwise approach to learning to rank: theory and algorithm. In ICML '08: Proceedings of the 25th international conference on Machine learning, pages 1192-1199, New York, NY, USA, 2008. ACM.
22. L. Yang, L. Wang, B. Geng, and X.-S. Hua. Query sampling for ranking learning in web search. In SIGIR '09: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 754-755, New York, NY, USA, 2009. ACM.
23. E. Yilmaz and S. Robertson. Deep versus shallow judgments in learning to rank. In SIGIR '09: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 662-663, New York, NY, USA, 2009. ACM.
24. H. Yu. SVM selective sampling for ranking with application to data retrieval. In KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pages 354-363. ACM, 2005.
25. Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 1697-1704, 2008.
26. O. Zoeter, N. Craswell, M. Taylor, J. Guiver, and E. Snelson. A decision theoretic framework for implicit relevance feedback. In NIPS Workshop on Machine learning for web search, 2007.