{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T14:31:51Z","timestamp":1774189911527,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1835804.1835953","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"1189-1198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Multi-task learning for boosting with application to web search ranking"],"prefix":"10.1145","author":[{"given":"Olivier","family":"Chapelle","sequence":"first","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]},{"given":"Pannagadatta","family":"Shivaswamy","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}]},{"given":"Srinivas","family":"Vadrevu","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]},{"given":"Kilian","family":"Weinberger","sequence":"additional","affiliation":[{"name":"Washington University, Saint Louis, MO, USA"}]},{"given":"Ya","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Belle","family":"Tseng","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Classification and regression trees","author":"Breiman L.","year":"1984","unstructured":"L. Breiman , J. Friedman , C. J. Stone , and R. A. Olshen . Classification and regression trees . Chapman & Hall\/CRC , 1984 . L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen. Classification and regression trees. Chapman & Hall\/CRC, 1984."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9111-2"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390177"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273521"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1699571.1699578"},{"key":"e_1_3_2_2_9_1","first-page":"115","volume-title":"Large margin rank boundaries for ordinal regression","author":"Herbrich R.","year":"2000","unstructured":"R. Herbrich , T. Graepel , and K. Obermayer . Large margin rank boundaries for ordinal regression , pages 115 -- 132 . MIT Press , Cambridge, MA , 2000 . R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression, pages 115--132. MIT Press, Cambridge, MA, 2000."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_2_11_1","volume-title":"NIPS","author":"Li P.","year":"2007","unstructured":"P. Li , C. J. C. Burges , and Q. Wu . Mcrank: Learning to rank using multiple classification and gradient boosting . In NIPS , 2007 . P. Li, C. J. C. Burges, and Q. Wu. Mcrank: Learning to rank using multiple classification and gradient boosting. In NIPS, 2007."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_2_13_1","first-page":"512","volume-title":"Neural information processing systems","author":"Mason L.","year":"2000","unstructured":"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 . 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."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1016790"},{"key":"e_1_3_2_2_15_1","volume-title":"Boosting the margin: A new explanation for the effectiveness of voting methods. The annals of statistics, 26(5):1651--1686","author":"Schapire R.","year":"1998","unstructured":"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 . 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."},{"key":"e_1_3_2_2_16_1","volume-title":"Learning with kernels","author":"Sch\u00f6lkopf B.","year":"2002","unstructured":"B. Sch\u00f6lkopf and A. Smola . Learning with kernels . MIT press Cambridge , MA , 2002 . B. Sch\u00f6lkopf and A. Smola. Learning with kernels. MIT press Cambridge, MA, 2002."},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of IEEE Computer Society Conference on Computer Vision and Patter Recognition","author":"Wang X.","year":"2009","unstructured":"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 . 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."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"e_1_3_2_2_19_1","volume-title":"NIPS","author":"Zheng Z.","year":"2007","unstructured":"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 . 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."}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Washington DC USA","acronym":"KDD '10","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835953","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835804.1835953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:09:03Z","timestamp":1750248543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":19,"alternative-id":["10.1145\/1835804.1835953","10.1145\/1835804"],"URL":"https:\/\/doi.org\/10.1145\/1835804.1835953","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}