{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T19:57:12Z","timestamp":1716494232891},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T00:00:00Z","timestamp":1371168000000},"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-5360-9","type":"journal-article","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T19:56:54Z","timestamp":1371153414000},"page":"261-292","source":"Crossref","is-referenced-by-count":9,"title":["Tune and mix: learning to rank using ensembles of calibrated multi-class classifiers"],"prefix":"10.1007","volume":"93","author":[{"given":"R\u00f3bert","family":"Busa-Fekete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bal\u00e1zs","family":"K\u00e9gl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"\u00c9ltet\u0151","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Szarvas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,14]]},"reference":[{"key":"5360_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-14125-6_2","volume-title":"Preference learning","author":"F. Aiolli","year":"2010","unstructured":"Aiolli, F., & Sperduti, A. (2010). A preference optimization based unifying framework for supervised learning problems. In J. F\u00fcrnkranz & E. H\u00fcllermeier (Eds.), Preference learning (pp.\u00a019\u201342). Berlin: Springer."},{"issue":"19","key":"5360_CR2","doi-asserted-by":"crossref","first-page":"1876","DOI":"10.1016\/j.tcs.2009.01.016","volume":"410","author":"J. Y. Audibert","year":"2009","unstructured":"Audibert, J. Y., Munos, R., & Szepesv\u00e1ri, C. (2009). Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theoretical Computer Science, 410(19), 1876\u20131902.","journal-title":"Theoretical Computer Science"},{"key":"5360_CR3","first-page":"322","volume-title":"Proceedings of the 36th annual symposium on foundations of computer science","author":"P. Auer","year":"1995","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. (1995). Gambling in a rigged casino: the adversarial multi-armed bandit problem. In Proceedings of the 36th annual symposium on foundations of computer science (pp.\u00a0322\u2013331). Los Alamitos: IEEE Computer Society Press."},{"issue":"1","key":"5360_CR4","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. (2002). The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 32(1), 48\u201377.","journal-title":"SIAM Journal on Computing"},{"key":"5360_CR5","volume-title":"NIPS\u201911 workshop on deep learning and unsupervised feature learning","author":"D. Benbouzid","year":"2011","unstructured":"Benbouzid, D., Busa-Fekete, R., & K\u00e9gl, B. (2011). MDDAG: learning deep decision DAGs in a Markov decision process setup. In NIPS\u201911 workshop on deep learning and unsupervised feature learning."},{"key":"5360_CR6","volume-title":"Proceedings of the 29th international conference on machine learning","author":"D. Benbouzid","year":"2012","unstructured":"Benbouzid, D., Busa-Fekete, R., & K\u00e9gl, B. (2012a). Fast classification using sparse decision DAGs. In Proceedings of the 29th international conference on machine learning."},{"key":"5360_CR7","first-page":"549","volume":"13","author":"D. Benbouzid","year":"2012","unstructured":"Benbouzid, D., Busa-Fekete, R., Casagrande, N., Collin, F. D., & K\u00e9gl, B. (2012b). MultiBoost: a multi-purpose boosting package. Journal of Machine Learning Research, 13, 549\u2013553.","journal-title":"Journal of Machine Learning Research"},{"key":"5360_CR8","first-page":"3","volume-title":"Proceedings of KDD cup and workshop 2007","author":"J. Bennett","year":"2007","unstructured":"Bennett, J., & Lanning, S. (2007). The Netflix prize. In Proceedings of KDD cup and workshop 2007 (pp.\u00a03\u20136)."},{"key":"5360_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1102351.1102363","volume-title":"Proceedings of the 22th international conference on machine learning","author":"C. Burges","year":"2005","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005). Learning to rank using gradient descent. In Proceedings of the 22th international conference on machine learning (pp.\u00a089\u201396)."},{"key":"5360_CR10","first-page":"25","volume-title":"Yahoo! Learning-to-rank challenge (JMLR W&CP)","author":"C. Burges","year":"2011","unstructured":"Burges, C., Svore, K., Bennett, P., Pastusiak, A., & Wu, Q. (2011). Learning to rank using an ensemble of lambda-gradient models. In Yahoo! Learning-to-rank challenge (JMLR W&CP) (Vol.\u00a014, pp.\u00a025\u201335)."},{"key":"5360_CR11","first-page":"111","volume-title":"KDDCup 2009 (JMLR W&CP)","author":"R. Busa-Fekete","year":"2009","unstructured":"Busa-Fekete, R., & K\u00e9gl, B. (2009). Accelerating AdaBoost using UCB. In KDDCup 2009 (JMLR W&CP), Paris, France (Vol.\u00a07, pp.\u00a0111\u2013122)."},{"key":"5360_CR12","first-page":"143","volume-title":"International conference on machine learning","author":"R. Busa-Fekete","year":"2010","unstructured":"Busa-Fekete, R., & K\u00e9gl, B. (2010). Fast boosting using adversarial bandits. In International conference on machine learning (Vol.\u00a027, pp.\u00a0143\u2013150)."},{"key":"5360_CR13","first-page":"37","volume-title":"JMLR W&CP","author":"R. Busa-Fekete","year":"2011","unstructured":"Busa-Fekete, R., K\u00e9gl, B., \u00c9ltet\u0151, T., & Szarvas, G. (2011a). Ranking by calibrated AdaBoost. In JMLR W&CP (Vol.\u00a014, pp.\u00a037\u201348)."},{"key":"5360_CR14","series-title":"LNCS","first-page":"263","volume-title":"European conference on machine learning","author":"R. Busa-Fekete","year":"2011","unstructured":"Busa-Fekete, R., K\u00e9gl, B., \u00c9ltet\u0151, T., & Szarvas, G. (2011b). A robust ranking methodology based on diverse calibration of AdaBoost. In LNCS: Vol.\u00a06911. European conference on machine learning (pp.\u00a0263\u2013279)."},{"key":"5360_CR15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/1718487.1718538","volume-title":"Proceedings of the third ACM international conference on web search and data mining","author":"B. B. Cambazoglu","year":"2010","unstructured":"Cambazoglu, B. B., Zaragoza, H., Chapelle, O., Chen, J., Liao, C., Zheng, Z., & Degenhardt, J. (2010). Early exit optimizations for additive machine learned ranking systems. In Proceedings of the third ACM international conference on web search and data mining (pp.\u00a0411\u2013420)."},{"key":"5360_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/1273496.1273513","volume-title":"Proceedings of the 24rd international conference on machine learning","author":"Z. Cao","year":"2007","unstructured":"Cao, Z., Qin, T., Liu, T., Tsai, M., & Li, H. (2007). Learning to rank: from pairwise approach to listwise approach. In Proceedings of the 24rd international conference on machine learning (pp. 129\u2013136)."},{"key":"5360_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, learning, and games","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. New York: Cambridge University Press."},{"key":"5360_CR18","first-page":"1","volume-title":"Yahoo! Learning-to-rank challenge (JMLR W&CP)","author":"O. Chapelle","year":"2011","unstructured":"Chapelle, O., & Chang, Y. (2011). Yahoo! Learning-to-rank challenge overview. In Yahoo! Learning-to-rank challenge (JMLR W&CP) (Vol.\u00a014, pp.\u00a01\u201324)."},{"issue":"3","key":"5360_CR19","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s10791-009-9110-3","volume":"13","author":"O. Chapelle","year":"2010","unstructured":"Chapelle, O., & Wu, M. (2010). Gradient descent optimization of smoothed information retrieval metrics. Information Retrievel, 13(3), 216\u2013235.","journal-title":"Information Retrievel"},{"key":"5360_CR20","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1145\/1645953.1646033","volume-title":"Proceeding of the 18th ACM conference on information and knowledge management","author":"O. Chapelle","year":"2009","unstructured":"Chapelle, O., Metlzer, D., Zhang, Y., & Grinspan, P. (2009). Expected reciprocal rank for graded relevance. In Proceeding of the 18th ACM conference on information and knowledge management (pp.\u00a0621\u2013630). New York: ACM."},{"key":"5360_CR21","series-title":"Journal of Machine Learning Research, Workshop and Conference Proceedings","volume-title":"Yahoo! Learning-to-rank challenge","year":"2011","unstructured":"Chapelle, O., Chang, Y., & Liu, T. (Eds.) (2011). Yahoo! Learning-to-rank challenge. Journal of Machine Learning Research, Workshop and Conference Proceedings (Vol.\u00a014)."},{"key":"5360_CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/1102351.1102370","volume-title":"Proceedings of the 22nd international conference on machine learning","author":"W. Chu","year":"2005","unstructured":"Chu, W., & Keerthi, S. (2005). New approaches to support vector ordinal regression. In Proceedings of the 22nd international conference on machine learning (pp.\u00a0145\u2013152)."},{"key":"5360_CR23","volume-title":"Advances in neural information processing systems","author":"C. Cortes","year":"2005","unstructured":"Cortes, C., & Mohri, M. (2005). Confidence intervals for the area under the ROC curve. In Advances in neural information processing systems (Vol.\u00a018). Cambridge: MIT Press."},{"issue":"11","key":"5360_CR24","doi-asserted-by":"crossref","first-page":"5140","DOI":"10.1109\/TIT.2008.929939","volume":"54","author":"D. Cossock","year":"2008","unstructured":"Cossock, D., & Zhang, T. (2008). Statistical analysis of Bayes optimal subset ranking. IEEE Transactions on Information Theory, 54(11), 5140\u20135154.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5360_CR25","first-page":"265","volume":"2","author":"K. Crammer","year":"2001","unstructured":"Crammer, K., & Singer, Y. (2001). On the algorithmic implementation of multiclass kernel-based vector machines. Journal of Machine Learning Research, 2, 265\u2013292.","journal-title":"Journal of Machine Learning Research"},{"key":"5360_CR26","series-title":"JMLR workshop and conference proceedings","volume-title":"Proceedings of KDD-cup 2009 competition","year":"2009","unstructured":"Dror, G., Boull\u00e9, M., Guyon, I., Lemaire, V., & Vogel, D. (Eds.) (2009). Proceedings of KDD-cup 2009 competition. JMLR workshop and conference proceedings (Vol.\u00a07)."},{"key":"5360_CR27","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-642-23780-5_34","volume-title":"Proceedings of the European conference on machine learning and knowledge discovery in databases (ECML-PKDD-11)","author":"G. Dulac-Arnold","year":"2011","unstructured":"Dulac-Arnold, G., Denoyer, L., Preux, P., & Gallinari, P. (2011). Datum-wise classification: a sequential approach to sparsity. In Proceedings of the European conference on machine learning and knowledge discovery in databases (ECML-PKDD-11), Athens, Greece, (pp.\u00a0375\u2013390), Part\u00a0I."},{"key":"5360_CR28","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, 119\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"key":"5360_CR29","first-page":"933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"5360_CR30","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","volume":"38","author":"J. Friedman","year":"2002","unstructured":"Friedman, J. (2002). Stochastic gradient boosting. Computational Statistics & Data Analysis, 38(4), 367\u2013378.","journal-title":"Computational Statistics & Data Analysis"},{"key":"5360_CR31","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The minimum description length principle","author":"P. Gruenwald","year":"2007","unstructured":"Gruenwald, P. (2007). The minimum description length principle. Cambridge: MIT Press."},{"key":"5360_CR32","series-title":"Advances in neural information processing systems","volume-title":"NEWTRON: an efficient bandit algorithm for online multiclass prediction","author":"E. Hazan","year":"2011","unstructured":"Hazan, E., & Kale, S. (2011). Advances in neural information processing systems: Vol.\u00a025. NEWTRON: an efficient bandit algorithm for online multiclass prediction. Cambridge: MIT Press."},{"key":"5360_CR33","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., & Kek\u00e4l\u00e4inen, J. (2002). Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20, 422\u2013446.","journal-title":"ACM Transactions on Information Systems"},{"key":"5360_CR34","volume-title":"Proceedings of the ACM conference on knowledge discovery and data mining (KDD)","author":"T. Joachims","year":"2006","unstructured":"Joachims, T. (2006). Training linear SVMs in linear time. In Proceedings of the ACM conference on knowledge discovery and data mining (KDD)."},{"key":"5360_CR35","first-page":"497","volume-title":"International conference on machine learning","author":"B. K\u00e9gl","year":"2009","unstructured":"K\u00e9gl, B., & Busa-Fekete, R. (2009). Boosting products of base classifiers. In International conference on machine learning, Montreal, Canada (Vol.\u00a026, pp.\u00a0497\u2013504)."},{"issue":"13","key":"5360_CR36","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1002\/asi.10137","volume":"53","author":"J. Kek\u00e4l\u00e4inen","year":"2002","unstructured":"Kek\u00e4l\u00e4inen, J., & J\u00e4rvelin, K. (2002). Using graded relevance assessments in IR evaluation. Journal of the American Society for Information Science and Technology, 53(13), 1120\u20131129.","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"5360_CR37","first-page":"1113","volume-title":"Proceedings of the 28th international conference on machine learning","author":"W. Kotlowski","year":"2011","unstructured":"Kotlowski, W., Dembczynski, K., & H\u00fcllermeier, E. (2011). Bipartite ranking through minimization of univariate loss. In Proceedings of the 28th international conference on machine learning (pp.\u00a01113\u20131120)."},{"key":"5360_CR38","first-page":"897","volume-title":"Advances in neural information processing systems","author":"P. Li","year":"2007","unstructured":"Li, P., Burges, C., & Wu, Q. (2007). McRank: learning to rank using multiple classification and gradient boosting. In Advances in neural information processing systems (Vol.\u00a019, pp.\u00a0897\u2013904). Cambridge: MIT Press."},{"key":"5360_CR39","first-page":"409","volume":"8","author":"D. Mease","year":"2007","unstructured":"Mease, D., Wyner, A., & Buja, A. (2007). Boosted classification trees and class probability\/quantile estimation. Journal of Machine Learning Research, 8, 409\u2013439.","journal-title":"Journal of Machine Learning Research"},{"key":"5360_CR40","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10791-006-9019-z","volume":"10","author":"D. Metzler","year":"2007","unstructured":"Metzler, D., & Croft, B. W. (2007). Linear feature-based models for information retrieval. Information Retrieval, 10, 257\u2013274.","journal-title":"Information Retrieval"},{"key":"5360_CR41","first-page":"413","volume-title":"Proceedings of the 21st international conference on uncertainty in artificial intelligence","author":"A. Niculescu-Mizil","year":"2005","unstructured":"Niculescu-Mizil, A., & Caruana, R. (2005). Obtaining calibrated probabilities from boosting. In Proceedings of the 21st international conference on uncertainty in artificial intelligence (pp.\u00a0413\u2013420)."},{"key":"5360_CR42","doi-asserted-by":"crossref","first-page":"61","DOI":"10.7551\/mitpress\/1113.003.0008","volume-title":"Advances in large margin classifiers","author":"J. Platt","year":"2000","unstructured":"Platt, J. (2000). Probabilistic outputs for support vector machines and comparison to regularized likelihood methods. In A. Smola, P. Bartlett, B. Schoelkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers (pp.\u00a061\u201374). Cambridge: MIT Press."},{"key":"5360_CR43","volume-title":"C4.5: programs for machine learning","author":"J. Quinlan","year":"1993","unstructured":"Quinlan, J. (1993). C4.5: programs for machine learning. San Mateo: Morgan Kaufmann."},{"key":"5360_CR44","volume-title":"JMLR workshop and conference proceedings, AISTATS","author":"P. Ravikumar","year":"2011","unstructured":"Ravikumar, P., Tewari, A., & Yang, E. (2011). On NDCG consistency of listwise ranking methods. In JMLR workshop and conference proceedings, AISTATS."},{"key":"5360_CR45","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J. Rissanen","year":"1983","unstructured":"Rissanen, J. (1983). A universal prior for integers and estimation by minimum description length. The Annals of Statistics, 11, 416\u2013431.","journal-title":"The Annals of Statistics"},{"key":"5360_CR46","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1561\/1500000019","volume":"3","author":"S. Robertson","year":"2009","unstructured":"Robertson, S., & Zaragoza, H. (2009). The probabilistic relevance framework: BM25 and beyond. Foundations and Trends in Information Retrieval, 3, 333\u2013389.","journal-title":"Foundations and Trends in Information Retrieval"},{"issue":"2","key":"5360_CR47","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.ipm.2006.07.020","volume":"43","author":"T. Sakai","year":"2007","unstructured":"Sakai, T. (2007). On the reliability of information retrieval metrics based on graded relevance. Information Processing & Management, 43(2), 531\u2013548.","journal-title":"Information Processing & Management"},{"issue":"3","key":"5360_CR48","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R. Schapire","year":"1999","unstructured":"Schapire, R., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3), 297\u2013336.","journal-title":"Machine Learning"},{"key":"5360_CR49","first-page":"1883","volume-title":"Advances in neural information processing systems","author":"H. Valizadegan","year":"2009","unstructured":"Valizadegan, H., Jin, R., Zhang, R., & Mao, J. (2009). Learning to rank by optimizing NDCG measure. In Advances in neural information processing systems (Vol.\u00a022, pp.\u00a01883\u20131891)."},{"issue":"3","key":"5360_CR50","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":"5360_CR51","first-page":"975","volume":"5","author":"T. Wu","year":"2004","unstructured":"Wu, T., Lin, C., & Weng, R. (2004). Probability estimates for multi-class classification by pairwise coupling. Journal of Machine Learning Research, 5, 975\u20131005.","journal-title":"Journal of Machine Learning Research"},{"key":"5360_CR52","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1145\/1277741.1277809","volume-title":"SIGIR \u201907: proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval","author":"J. Xu","year":"2007","unstructured":"Xu, J., & Li, H. (2007). AdaRank: a boosting algorithm for information retrieval. In SIGIR \u201907: proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval (pp. 391\u2013398). New York: ACM."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5360-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-013-5360-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5360-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T10:29:11Z","timestamp":1715509751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-013-5360-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,14]]},"references-count":52,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["5360"],"URL":"https:\/\/doi.org\/10.1007\/s10994-013-5360-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,14]]}}}