{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T09:45:28Z","timestamp":1778751928053,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2013,6,7]],"date-time":"2013-06-07T00:00:00Z","timestamp":1370563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10994-013-5364-5","type":"journal-article","created":{"date-parts":[[2013,6,6]],"date-time":"2013-06-06T17:00:11Z","timestamp":1370538011000},"page":"293-320","source":"Crossref","is-referenced-by-count":5,"title":["BoostingTree: parallel selection of weak learners in boosting, with application to ranking"],"prefix":"10.1007","volume":"93","author":[{"given":"Levente","family":"Kocsis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Gy\u00f6rgy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea N.","family":"B\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,7]]},"reference":[{"issue":"2\u20133","key":"5364_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002a). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2\u20133), 235\u2013256.","journal-title":"Machine Learning"},{"key":"5364_CR2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. (2002b). The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32, 48\u201377.","journal-title":"SIAM Journal on Computing"},{"key":"5364_CR3","first-page":"25","volume":"14","author":"C. J. C. Burges","year":"2011","unstructured":"Burges, C. J. C., Svore, K. M., Bennett, P. N., Pastusiak, A., & Wu, Q. (2011). Learning to rank using an ensemble of lambda-gradient models. Journal of Machine Learning Research, 14, 25\u201335.","journal-title":"Journal of Machine Learning Research"},{"key":"5364_CR4","first-page":"111","volume":"7","author":"R. Busa-Fekete","year":"2009","unstructured":"Busa-Fekete, R., & K\u00e9gl, B. (2009). Accelerating AdaBoost using UCB. Journal of Machine Learning Research Workshop and Conference Proceedings, 7, 111\u2013122.","journal-title":"Journal of Machine Learning Research Workshop and Conference Proceedings"},{"key":"5364_CR5","first-page":"143","volume-title":"Proceedings of the 27th international conference on machine learning (ICML-10)","author":"R. Busa-Fekete","year":"2010","unstructured":"Busa-Fekete, R., & K\u00e9gl, B. (2010). Fast boosting using adversarial bandits. In J. F\u00fcrnkranz & T. Joachims (Eds.), Proceedings of the 27th international conference on machine learning (ICML-10) (pp. 143\u2013150)."},{"key":"5364_CR6","first-page":"456","volume-title":"Proceedings of the 21st international joint conference on artificial intelligence (IJCAI)","author":"T. Cazenave","year":"2009","unstructured":"Cazenave, T. (2009). Nested Monte-Carlo search. In C. Boutilier (Ed.), Proceedings of the 21st international joint conference on artificial intelligence (IJCAI) (pp. 456\u2013461)."},{"key":"5364_CR7","first-page":"1","volume":"14","author":"O. Chapelle","year":"2011","unstructured":"Chapelle, O., & Chang, Y. (2011). Yahoo! Learning to rank challenge overview. Journal of Machine Learning Research Workshop and Conference Proceedings, 14, 1\u201324.","journal-title":"Journal of Machine Learning Research Workshop and Conference Proceedings"},{"key":"5364_CR8","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1145\/1571941.1572021","volume-title":"Proceedings of the 32nd international ACM SIGIR conference on research and development in information retrieval (SIGIR)","author":"P. Donmez","year":"2009","unstructured":"Donmez, P., Svore, K. M., & Burges, C. J. (2009). On the local optimality of lambdarank. In Proceedings of the 32nd international ACM SIGIR conference on research and development in information retrieval (SIGIR) (pp. 460\u2013467)."},{"key":"5364_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-45164-1_14","volume-title":"11th European conference on machine learning (ECML)","author":"G. Escudero","year":"2000","unstructured":"Escudero, G., M\u00e0rquez, L., & Rigau, G. (2000). Boosting applied toe word sense disambiguation. In R. L. de M\u00e1ntaras & E. Plaza (Eds.), Lecture notes in computer science: Vol.\u00a01810. 11th European conference on machine learning (ECML) (pp. 129\u2013141). Berlin: Springer."},{"key":"5364_CR10","first-page":"124","volume-title":"Proceedings of the 16th international conference on machine learning","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., & Mason, L. (1999). The alternating decision tree algorithm. In Proceedings of the 16th international conference on machine learning (pp. 124\u2013133)."},{"issue":"1","key":"5364_CR11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"key":"5364_CR12","first-page":"170","volume-title":"Proceedings of the 15th international conference on machine learning (ICML)","author":"Y. Freund","year":"1998","unstructured":"Freund, Y., Iyer, R. D., Schapire, R. E., & Singer, Y. (1998). An efficient boosting algorithm for combining preferences. In J. W. Shavlik (Ed.), Proceedings of the 15th international conference on machine learning (ICML) (pp. 170\u2013178). San Mateo: Morgan Kaufmann."},{"key":"5364_CR13","first-page":"1537","volume-title":"Proceedings of the 23rd AAAI conference on artificial intelligence","author":"S. Gelly","year":"2008","unstructured":"Gelly, S., & Silver, D. (2008). Achieving master level play in 9\u00d79 computer go. In D. Fox & C. P. Gomes (Eds.), Proceedings of the 23rd AAAI conference on artificial intelligence (pp. 1537\u20131540). Menlo Park: AAAI Press."},{"key":"5364_CR14","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1613\/jair.3313","volume":"41","author":"A. Gy\u00f6rgy","year":"2011","unstructured":"Gy\u00f6rgy, A., & Kocsis, L. (2011). Efficient multi-start strategies for local search algorithms. The Journal of Artificial Intelligence Research, 41, 407\u2013444.","journal-title":"The Journal of Artificial Intelligence Research"},{"issue":"2","key":"5364_CR15","first-page":"79","volume":"20","author":"R. M. Hyatt","year":"1997","unstructured":"Hyatt, R. M., & Newborn, M. (1997). CRAFTY goes deep. ICCA Journal, 20(2), 79\u201386.","journal-title":"ICCA Journal"},{"key":"5364_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/345508.345545","volume-title":"Proceedings of the 23rd international ACM SIGIR conference on research and development in information retrieval (SIGIR)","author":"K. J\u00e4rvelin","year":"2000","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2000). IR evaluation methods for retrieving highly relevant documents. In Proceedings of the 23rd international ACM SIGIR conference on research and development in information retrieval (SIGIR) (pp. 41\u201348)."},{"issue":"1","key":"5364_CR17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"D. R. Jones","year":"1993","unstructured":"Jones, D. R., Perttunen, C. D., & Stuckman, B. E. (1993). Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Applications, 79(1), 157\u2013181.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"5364_CR18","first-page":"282","volume-title":"Proceedings of the 17th European conference on machine learning (ECML)","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., & Szepesv\u00e1ri, C. (2006). Bandit based Monte-Carlo planning. In J. F\u00fcrnkranz, T. Scheffer, & M. Spiliopoulou (Eds.), Proceedings of the 17th European conference on machine learning (ECML) (pp.\u00a0282\u2013293)."},{"key":"5364_CR19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., & Zuckerman, D. (1993). Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47, 173\u2013180.","journal-title":"Information Processing Letters"},{"key":"5364_CR20","first-page":"211","volume-title":"Proceedings of the 14th international conference on machine learning (ICML 1997)","author":"D. D. Margineantu","year":"1997","unstructured":"Margineantu, D. D., & Dietterich, T. G. (1997). Pruning adaptive boosting. In D. H. Fisher (Ed.), Proceedings of the 14th international conference on machine learning (ICML 1997) (pp. 211\u2013218). San Mateo: Morgan Kaufmann."},{"issue":"2","key":"5364_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/TPAMI.2008.78","volume":"31","author":"G. Mart\u00ednez-Mu\u00f1oz","year":"2009","unstructured":"Mart\u00ednez-Mu\u00f1oz, G., Hern\u00e1ndez-Lobato, D., & Su\u00e1rez, A. (2009). An analysis of ensemble pruning techniques based on ordered aggregation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2), 245\u2013259.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5364_CR22","volume-title":"Classification of chess openings","author":"A. Matanovi\u0107","year":"1971","unstructured":"Matanovi\u0107, A., Molorovi\u0107, M., & Bo\u017ei\u0107, A. (1971). Classification of chess openings. Beograd: Chess Informant."},{"key":"5364_CR23","first-page":"783","volume-title":"Advances in neural information processing systems 24","author":"R. Munos","year":"2011","unstructured":"Munos, R. (2011). Optimistic optimization of deterministic functions without the knowledge of its smoothness. In J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. C. N. Pereira, & K. Q. Weinberger (Eds.), Advances in neural information processing systems 24 (pp. 783\u2013791)."},{"key":"5364_CR24","volume-title":"Nonlinear estimation and classification","author":"R. E. Schapire","year":"2002","unstructured":"Schapire, R. E. (2002). The boosting approach to machine learning: an overview. In D. D. Denison, M.\u00a0H. Hansen, C. Holmes, B. Mallick, & B. Yu (Eds.), Nonlinear estimation and classification. Berlin: Springer."},{"key":"5364_CR25","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/11889205_40","volume-title":"Proceedings of the 12th international conference on principles and practice of constraint programming (CP2006)","author":"M. J. Streeter","year":"2006","unstructured":"Streeter, M. J., & Smith, S. F. (2006). A simple distribution-free approach to the max k-armed bandit problem. In Proceedings of the 12th international conference on principles and practice of constraint programming (CP2006), Nantes, France, September 25\u201329, 2006 (pp. 560\u2013574)."},{"key":"5364_CR26","first-page":"404","volume-title":"Proceedings of the 11th European conference on machine learning (ECML)","author":"C. Tamon","year":"2000","unstructured":"Tamon, C., & Xiang, J. (2000). On the boosting pruning problem. In R. L. de M\u00e1ntaras & E. Plaza (Eds.), Proceedings of the 11th European conference on machine learning (ECML) (pp. 404\u2013412). Barcelona."},{"key":"5364_CR27","series-title":"Studies in computational intelligence","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-03999-7_1","volume-title":"Applications of supervised and unsupervised ensemble methods","author":"G. Tsoumakas","year":"2009","unstructured":"Tsoumakas, G., Partalas, I., & Vlahavas, I. P. (2009). An ensemble pruning primer. In O. Okun & G. Valentini (Eds.), Studies in computational intelligence: Vol.\u00a0245. Applications of supervised and unsupervised ensemble methods (pp. 1\u201313). Berlin: Springer."},{"key":"5364_CR28","first-page":"1883","volume-title":"Advances in neural information processing systems 22","author":"H. Valizadegan","year":"2009","unstructured":"Valizadegan, H., Jin, R., Zhang, R., & Mao, J. (2009). Learning to rank by optimizing ndcg measure. In Y.\u00a0Bengio, D. Schuurmans, J. D. Lafferty, C. K. I. Williams, & A. Culotta (Eds.), Advances in neural information processing systems 22 (pp. 1883\u20131891)."},{"issue":"3","key":"5364_CR29","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/s10791-009-9112-1","volume":"13","author":"Q. Wu","year":"2010","unstructured":"Wu, Q., Burges, C. J. C., Svore, K. M., & Gao, J. (2010). Adapting boosting for information retrieval measures. Information Retrieval, 13(3), 254\u2013270.","journal-title":"Information Retrieval"},{"key":"5364_CR30","first-page":"615","volume":"5","author":"Y. T. Xi","year":"2009","unstructured":"Xi, Y. T., Xiang, Z. J., Ramadge, P. J., & Schapire, R. E. (2009). Speed and sparsity of regularized boosting. Journal of Machine Learning Research Workshop and Conference Proceedings, 5, 615\u2013622.","journal-title":"Journal of Machine Learning Research Workshop and Conference Proceedings"},{"key":"5364_CR31","first-page":"1625","volume-title":"Proceedings of the 34th IEEE international conference on acoustics, speech, and signal processing (ICASSP)","author":"Z. J. Xiang","year":"2009","unstructured":"Xiang, Z. J., & Ramadge, P. J. (2009). Sparse boosting. In Proceedings of the 34th IEEE international conference on acoustics, speech, and signal processing (ICASSP) (pp. 1625\u20131628)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5364-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-013-5364-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5364-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T20:54:19Z","timestamp":1563137659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-013-5364-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,7]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["5364"],"URL":"https:\/\/doi.org\/10.1007\/s10994-013-5364-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,7]]}}}