Multi-task learning for boosting with application to web search ranking

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 1189-1197

  Chapelle, Olivier ^a   Shivaswamy, Pannagadatta ^b   Vadrevu, Srinivas ^a   Weinberger, Kilian ^c   Ya, Zhang ^d   Tseng, Belle ^a  

^a YAHOO RESEARCH   (United States)

^b Fu Foundation School of Engineering and Applied Science   (United States)

^c WASHINGTON UNIVERSITY   (United States)

^d SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Algorithms

Indexed keywords

BOOSTED DECISION TREES; DATA SETS; DATA SHARING; JOINT MODELS; LEARNING METHODS; LEARNING TASKS; MULTITASK LEARNING; NOVEL ALGORITHM; WEB SEARCHES;

ALGORITHMS; DECISION TREES;

WORLD WIDE WEB;

EID: 77956199737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835953     Document Type: Conference Paper

References (19)

1. L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen. Classification and regression trees. Chapman & Hall/CRC, 1984.
2. R. Caruana. Multitask learning. In Machine Learning, pages 41-75, 1997.
3. D. Chen, Y. Xiong, J. Yan, G.-R. Xue, G. Wang, and Z. Chen. Knowledge transfer for cross domain learning to rank. Information Retrieval, 2009.
4. R. Collobert and J. Weston. A unified architecture for NLP: Deep neural networks with multitask learning. In Proceedings of the 25th international conference on Machine learning, pages 160-167. ACM New York, NY, USA, 2008.
5. W. Dai, Q. Yang, G. Xue, and Y. Yu. Boosting for transfer learning. In Proceedings of the 24th international conference on Machine learning, pages 193-200. ACM, 2007.
6. T. Evgeniou and M. Pontil. Regularized multi-task learning. In KDD, pages 109-117, 2004.
7. J. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 29:1189-1232, 2001.
8. J. Gao, Q. Wu, C. Burges, K. Svore, Y. Su, N. Khan, S. Shah, and H. Zhou. Model adaptation via model interpolation and boosting for web search ranking. In EMNLP, pages 505-513, 2009.
9. R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression, pages 115-132. MIT Press, Cambridge, MA, 2000.
10. K. Jarvelin and J. Kekalainen. IR evaluation methods for retrieving highly relevant documents. In SIGIR, pages 41-48. New York: ACM, 2002.
11. P. Li, C. J. C. Burges, and Q. Wu. Mcrank: Learning to rank using multiple classification and gradient boosting. In NIPS, 2007.
12. T.-Y. Liu. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3(3):225-231, 2009.
13. L. Mason, J. Baxter, P. Bartlett, and M. Frean. Boosting algorithms as gradient descent in function space. In Neural information processing systems, volume 12, pages 512-518, 2000.
14. S. Rosset, J. Zhu, T. Hastie, and R. Schapire. Boosting as a regularized path to a maximum margin classifier. Journal of Machine Learning Research, 5:941-973, 2004.
15. R. Schapire, Y. Freund, P. Bartlett, and W. Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. The annals of statistics, 26(5):1651-1686, 1998.
16. B. Schölkopf and A. Smola. Learning with kernels. MIT press Cambridge, MA, 2002.
17. X. Wang, C. Zhang, and Z. Zhang. Boosted multi-task learning for face verification with applications to web image and video search. In Proceedings of IEEE Computer Society Conference on Computer Vision and Patter Recognition, 2009.
18. K. Weinberger, A. Dasgupta, J. Attenberg, J. Langford, and A. Smola. Feature hashing for large scale multitask learning. In ICML, 2009.
19. 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 NIPS, 2007.