{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:01:40Z","timestamp":1760367700172,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,7]],"date-time":"2016-07-07T00:00:00Z","timestamp":1467849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FAPEMIG"},{"name":"Google Inc. Research Awards for Latin America"},{"name":"InWeb","award":["grant MCT\/CNPq 573871\/2008- 6"],"award-info":[{"award-number":["grant MCT\/CNPq 573871\/2008- 6"]}]},{"name":"MASWeb","award":["grant FAPEMIG\/PRONEX APQ-01400-14"],"award-info":[{"award-number":["grant FAPEMIG\/PRONEX APQ-01400-14"]}]},{"name":"Capes"},{"name":"CNPq"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,7]]},"DOI":"10.1145\/2911451.2911540","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"95-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Generalized BROOF-L2R"],"prefix":"10.1145","author":[{"given":"Clebson C.A.","family":"de S\u00e1","sequence":"first","affiliation":[{"name":"Federal University of Minas gerais, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos A.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[{"name":"University Federal of Minas Gerais, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel X.","family":"Sousa","sequence":"additional","affiliation":[{"name":"University Federal of Minas Gerais, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thiago","family":"Salles","sequence":"additional","affiliation":[{"name":"University Federal of Minas Gerais, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5360-9"},{"issue":"3","key":"e_1_3_2_1_3_1","first-page":"453","article-title":"A comparative study of learning-to-rank techniques for tag recommendation","volume":"4","author":"Canuto S. D.","year":"2013","unstructured":"S. D. Canuto, F. M. Bel\u00e9m, J. M. Almeida, and M. A. Gon\u00e7alves. A comparative study of learning-to-rank techniques for tag recommendation. JIDM, 4(3):453--468, 2013.","journal-title":"JIDM"},{"key":"e_1_3_2_1_4_1","volume-title":"Yahoo! learning to rank challenge overview. JMLR - Proceedings Track, 14:1--24","author":"Chapelle O.","year":"2011","unstructured":"O. Chapelle and Y. Chang. Yahoo! learning to rank challenge overview. JMLR - Proceedings Track, 14:1--24, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741678"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_3_2_1_8_1","first-page":"148","volume-title":"ICML","author":"Freund Y.","year":"1996","unstructured":"Y. Freund and R. E. Schapire. Experiments with a New Boosting Algorithm. In ICML, pages 148--156, 1996."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6226-1"},{"key":"e_1_3_2_1_11_1","first-page":"49","volume-title":"Proc. of the Yahoo! L2R Challenge, held at ICML 2010, Haifa, Israel, June 25, 2010, volume 14 of JMLR Proceedings Track","author":"Geurts P.","year":"2011","unstructured":"P. Geurts and G. Louppe. Learning to rank with extremely randomized trees. In Proc. of the Yahoo! L2R Challenge, held at ICML 2010, Haifa, Israel, June 25, 2010, volume 14 of JMLR Proceedings Track, pages 49--61, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"e_1_3_2_1_13_1","volume-title":"ICML","author":"Jin R.","year":"2003","unstructured":"R. Jin, Y. Liu, L. Si, J. Carbonell, and A. G. Hauptmann. A new boosting algorithm using input-dependent regularizer. In ICML, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2508063"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767733"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9209-9"},{"key":"e_1_3_2_1_20_1","first-page":"512","volume-title":"In Advances in 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 In Advances in Neural Information Processing Systems, pages 512--518, 2000."},{"key":"e_1_3_2_1_21_1","volume-title":"Boosted random forests. IEICE Transactions, 98-D(9):1630--1636","author":"Mishina Y.","year":"2015","unstructured":"Y. Mishina, R. Murata, Y. Yamauchi, T. Yamashita, and H. Fujiyoshi. Boosted random forests. IEICE Transactions, 98-D(9):1630--1636, 2015."},{"key":"e_1_3_2_1_22_1","volume-title":"JMLR Workshop and Conference Proceedings: Proceedings of the Yahoo! Learning to Rank Challenge, 14:77--89","author":"Mohan A.","year":"2011","unstructured":"A. Mohan, Z. Chen, and K. Weinberger. Web-search ranking with initialized gradient boosted regression trees. JMLR Workshop and Conference Proceedings: Proceedings of the Yahoo! Learning to Rank Challenge, 14:77--89, 2011."},{"key":"e_1_3_2_1_23_1","volume-title":"Park. Confidence Intervals for Information Retrieval Evaluation. Australiasian Document Computing Symposium","author":"L.","year":"2010","unstructured":"L. a. F. Park. Confidence Intervals for Information Retrieval Evaluation. Australiasian Document Computing Symposium, 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767747"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2207821"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.22.54"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767738"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864764"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995316"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.07.002"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_33_1","volume-title":"ICML","author":"Xu Z. E.","year":"2012","unstructured":"Z. E. Xu, K. Q. Weinberger, and O. Chapelle. The greedy miser: Learning under test-time budgets. In ICML, 2012."}],"event":{"name":"SIGIR '16: The 39th International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Pisa Italy","acronym":"SIGIR '16"},"container-title":["Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2911451.2911540","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2911451.2911540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:03Z","timestamp":1750222503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2911451.2911540"}},"subtitle":["A General Framework for Learning to Rank Based on Boosting and Random Forests"],"short-title":[],"issued":{"date-parts":[[2016,7,7]]},"references-count":33,"alternative-id":["10.1145\/2911451.2911540","10.1145\/2911451"],"URL":"https:\/\/doi.org\/10.1145\/2911451.2911540","relation":{},"subject":[],"published":{"date-parts":[[2016,7,7]]},"assertion":[{"value":"2016-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}