{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T02:53:30Z","timestamp":1790909610306,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,24]],"date-time":"2011-07-24T00:00:00Z","timestamp":1311465600000},"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":[[2011,7,24]]},"DOI":"10.1145\/2009916.2009932","type":"proceedings-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T14:09:37Z","timestamp":1311689377000},"page":"85-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":129,"title":["Bagging gradient-boosted trees for high precision, low variance ranking models"],"prefix":"10.1145","author":[{"given":"Yasser","family":"Ganjisaffar","sequence":"first","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rich","family":"Caruana","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cristina Videira","family":"Lopes","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Microsoft learning to rank datasets. http:\/\/research.microsoft.com\/en-us\/projects\/mslr\/. Microsoft learning to rank datasets. http:\/\/research.microsoft.com\/en-us\/projects\/mslr\/."},{"key":"e_1_3_2_1_2_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","year":"1999","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto . Modern Information Retrieval . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 1999 . R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018054314350"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017934522171"},{"key":"e_1_3_2_1_7_1","first-page":"193","volume-title":"NIPS","author":"Burges C. J. C.","year":"2006","unstructured":"C. J. C. Burges , R. Ragno , and Q. V. Le . Learning to rank with nonsmooth cost functions . In NIPS , pages 193 -- 200 , 2006 . C. J. C. Burges, R. Ragno, and Q. V. Le. Learning to rank with nonsmooth cost functions. In NIPS, pages 193--200, 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_10_1","unstructured":"O. Chapelle Y. Chang and T.-Y. Liu. The Yahoo! learning to rank challenge. http:\/\/learningtorankchallenge.yahoo.com 2010. O. Chapelle Y. Chang and T.-Y. Liu. The Yahoo! learning to rank challenge. http:\/\/learningtorankchallenge.yahoo.com 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9110-3"},{"key":"e_1_3_2_1_12_1","first-page":"641","volume-title":"Advances in Neural Information Processing Systems 14","author":"Crammer K.","year":"2001","unstructured":"K. Crammer and Y. Singer . Pranking with ranking . In Advances in Neural Information Processing Systems 14 , pages 641 -- 647 . MIT Press , 2001 . K. Crammer and Y. Singer. Pranking with ranking. In Advances in Neural Information Processing Systems 14, pages 641--647. MIT Press, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_3_2_1_14_1","volume-title":"Technical report, Dept. Statistics","author":"Friedman J. H.","year":"1999","unstructured":"J. H. Friedman . Stochastic gradient boosting. Technical report , Technical report, Dept. Statistics , Stanford Univ. , 1999 . J. H. Friedman. Stochastic gradient boosting. Technical report, Technical report, Dept. Statistics, Stanford Univ., 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.1.1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7551\/mitpress\/1113.003.0010","volume-title":"Advances in Large Margin Classifiers","author":"Herbrich R.","year":"2000","unstructured":"R. Herbrich , T. Graepel , and K. Obermayer . Large margin rank boundaries for ordinal regression . In A. Smola, P. Bartlett, B. Sch\u00f6lkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers , pages 115 -- 132 , Cambridge, MA , 2000 . MIT Press . R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In A. Smola, P. Bartlett, B. Sch\u00f6lkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 115--132, Cambridge, MA, 2000. MIT Press."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.273716"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_3_2_1_21_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_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871758"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835928"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74958-5_31"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_76"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277808"},{"key":"e_1_3_2_1_29_1","first-page":"752","volume-title":"Proceedings of the International Conference on Machine Learning, ICML'03","author":"Valentini G.","year":"2003","unstructured":"G. Valentini and T. G. Dietterich . Low bias bagged support vector machines . In Proceedings of the International Conference on Machine Learning, ICML'03 , pages 752 -- 759 . Morgan Kaufmann , 2003 . G. Valentini and T. G. Dietterich. Low bias bagged support vector machines. In Proceedings of the International Conference on Machine Learning, ICML'03, pages 752--759. Morgan Kaufmann, 2003."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553513"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007659514849"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277790"}],"event":{"name":"SIGIR '11: The 34th International ACM SIGIR conference on research and development in Information Retrieval","location":"Beijing China","acronym":"SIGIR '11","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2009916.2009932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2009916.2009932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:29Z","timestamp":1750245749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2009916.2009932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,24]]},"references-count":32,"alternative-id":["10.1145\/2009916.2009932","10.1145\/2009916"],"URL":"https:\/\/doi.org\/10.1145\/2009916.2009932","relation":{},"subject":[],"published":{"date-parts":[[2011,7,24]]},"assertion":[{"value":"2011-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}