{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T20:39:51Z","timestamp":1768595991643,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Commission","award":["654024"],"award-info":[{"award-number":["654024"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,7]]},"DOI":"10.1145\/3077136.3080725","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T19:35:01Z","timestamp":1501270501000},"page":"1077-1080","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["X-DART"],"prefix":"10.1145","author":[{"given":"Claudio","family":"Lucchese","sequence":"first","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco Maria","family":"Nardini","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Orlando","sequence":"additional","affiliation":[{"name":"Ca' Foscari University of Venice, Venice, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Perego","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Trani","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.05.004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_5_1","unstructured":"A. Gulin I. Kuralenok and D. Pavlov 2011. Winning The Transfer Learning Track of Yahoo!'s Learning To Rank Challenge with YetiRank. Yahoo! Learning to Rank Challenge. 63--76.  A. Gulin I. Kuralenok and D. Pavlov 2011. Winning The Transfer Learning Track of Yahoo!'s Learning To Rank Challenge with YetiRank. Yahoo! Learning to Rank Challenge. 63--76."},{"key":"e_1_3_2_1_6_1","volume-title":"Post-Learning Optimization of Tree Ensembles for Efficient Ranking Proc. ACM SIGIR '16'. ACM, 949--952","author":"Lucchese C.","unstructured":"C. Lucchese , F. M. Nardini , S. Orlando , R. Perego , F. Silvestri , and S. Trani . Post-Learning Optimization of Tree Ensembles for Efficient Ranking Proc. ACM SIGIR '16'. ACM, 949--952 . C. Lucchese, F. M. Nardini, S. Orlando, R. Perego, F. Silvestri, and S. Trani. Post-Learning Optimization of Tree Ensembles for Efficient Ranking Proc. ACM SIGIR '16'. ACM, 949--952."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"C. Lucchese F. M. Nardini S. Orlando R. Perego N. Tonellotto and R. Venturini. 2015. QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees Proc. ACM SIGIR. 73--82.  C. Lucchese F. M. Nardini S. Orlando R. Perego N. Tonellotto and R. Venturini. 2015. QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees Proc. ACM SIGIR. 73--82.","DOI":"10.1145\/2766462.2767733"},{"key":"e_1_3_2_1_8_1","article-title":"Dart: Dropouts meet multiple additive regression trees","volume":"38","author":"Rashmi K.V.","year":"2015","unstructured":"K.V. Rashmi and R. Gilad-Bachrach 2015 . Dart: Dropouts meet multiple additive regression trees . Journal of Machine Learning Research Vol. 38 (2015). K.V. Rashmi and R. Gilad-Bachrach 2015. Dart: Dropouts meet multiple additive regression trees. Journal of Machine Learning Research Vol. 38 (2015).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"M. D. Smucker J. Allan and B. Carterette 2007. A Comparison of Statistical Significance Tests for Information Retrieval Evaluation Proc. CIKM. ACM.  M. D. Smucker J. Allan and B. Carterette 2007. A Comparison of Statistical Significance Tests for Information Retrieval Evaluation Proc. CIKM. ACM.","DOI":"10.1145\/1321440.1321528"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Q. Wu C.J.C. Burges K.M. Svore and J. Gao. 2010. Adapting boosting for information retrieval measures. Information Retrieval (2010).  Q. Wu C.J.C. Burges K.M. Svore and J. Gao. 2010. Adapting boosting for information retrieval measures. Information Retrieval (2010).","DOI":"10.1007\/s10791-009-9112-1"}],"event":{"name":"SIGIR '17: The 40th International ACM SIGIR conference on research and development in Information Retrieval","location":"Shinjuku Tokyo Japan","acronym":"SIGIR '17","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080725","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3077136.3080725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:06Z","timestamp":1750273446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080725"}},"subtitle":["Blending Dropout and Pruning for Efficient Learning to Rank"],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":11,"alternative-id":["10.1145\/3077136.3080725","10.1145\/3077136"],"URL":"https:\/\/doi.org\/10.1145\/3077136.3080725","relation":{},"subject":[],"published":{"date-parts":[[2017,8,7]]},"assertion":[{"value":"2017-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}