{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T21:24:24Z","timestamp":1785878664210,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642411359","type":"print"},{"value":"9783642411366","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41136-6_5","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T09:16:27Z","timestamp":1386753387000},"page":"37-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":967,"title":["Explaining AdaBoost"],"prefix":"10.1007","author":[{"given":"Robert E.","family":"Schapire","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,10,9]]},"reference":[{"key":"5_CR1","first-page":"2347","volume":"8","author":"P.L. Bartlett","year":"2007","unstructured":"Bartlett, P.L., Traskin, M.: AdaBoost is consistent. J. Mach. Learn. Res. 8, 2347\u20132368 (2007)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","volume":"1","author":"E.B. Baum","year":"1989","unstructured":"Baum, E.B., Haussler, D.: What size net gives valid generalization? Neural Comput. 1(1), 151\u2013160 (1989)","journal-title":"Neural Comput."},{"key":"5_CR3","first-page":"705","volume":"7","author":"P.J. Bickel","year":"2006","unstructured":"Bickel, P.J., Ritov, Y., Zakai, A.: Some theory for generalized boosting algorithms. J. Mach. Learn. Res. 7, 705\u2013732 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"7","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L. Breiman","year":"1999","unstructured":"Breiman, L.: Prediction games and arcing classifiers. Neural Comput. 11(7), 1493\u20131517 (1999)","journal-title":"Neural Comput."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aos\/1079120126","volume":"32","author":"L. Breiman","year":"2004","unstructured":"Breiman, L.: Population theory for boosting ensembles. Ann. Stat. 32(1), 1\u201311 (2004)","journal-title":"Ann. Stat."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T.G. Dietterich","year":"2000","unstructured":"Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Mach. Learn. 40(2), 139\u2013158 (2000)","journal-title":"Mach. Learn."},{"key":"5_CR7","volume-title":"A simple cost function for boosting","author":"M. Frean","year":"1998","unstructured":"Frean, M., Downs, T.: A simple cost function for boosting. Technical report, Department of Computer Science and Electrical Engineering, University of Queensland (1998)"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y.: Boosting a weak learning algorithm by majority. Inf. Comput. 121(2), 256\u2013285 (1995)","journal-title":"Inf. Comput."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1010852229904","volume":"43","author":"Y. Freund","year":"2001","unstructured":"Freund, Y.: An adaptive version of the boost by majority algorithm. Mach. Learn. 43(3), 293\u2013318 (2001)","journal-title":"Mach. Learn."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"J.H. Friedman","year":"2001","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29(5), 1189\u20131232 (2001)","journal-title":"Ann. Stat."},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J. Friedman","year":"2000","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Additive logistic regression: a statistical view of boosting. Ann. Stat. 28(2), 337\u2013407 (2000)","journal-title":"Ann. Stat."},{"key":"5_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T. Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. Springer, New York (2009)","edition":"2"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1214\/aos\/1079120128","volume":"32","author":"W. Jiang","year":"2004","unstructured":"Jiang, W.: Process consistency for AdaBoost. Ann. Stat. 32(1), 13\u201329 (2004)","journal-title":"Ann. Stat."},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jcss.2004.10.015","volume":"71","author":"A.T. Kalai","year":"2005","unstructured":"Kalai, A.T., Servedio, R.A.: Boosting in the presence of noise. J. Comput. Syst. Sci. 71(3), 266\u2013290 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Long, P.M., Servedio, R.A.: Adaptive martingale boosting. In: 18th Annual Conference on Learning Theory, Bertinoro (2005)","DOI":"10.1007\/11503415_6"},{"key":"5_CR17","unstructured":"Long, P.M., Servedio, R.A.: Adaptive martingale boosting. Advances in Neural Information Processing Systems 21, Vancouver (2009)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10994-009-5165-z","volume":"78","author":"P.M. Long","year":"2010","unstructured":"Long, P.M., Servedio, R.A.: Random classification noise defeats all convex potential boosters. Mach. Learn. 78, 287\u2013304 (2010)","journal-title":"Mach. Learn."},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1214\/aos\/1079120129","volume":"32","author":"G. Lugosi","year":"2004","unstructured":"Lugosi, G., Vayatis, N.: On the Bayes-risk consistency of regularized boosting methods. Ann. Stat. 32(1), 30\u201355 (2004)","journal-title":"Ann. Stat."},{"key":"5_CR20","unstructured":"Maclin, R., Opitz, D.: An empirical evaluation of bagging and boosting. In: Proceedings of the 14th National Conference on Artificial Intelligence, Providence, pp.\u00a0546\u2013551 (1997)"},{"key":"5_CR21","first-page":"713","volume":"4","author":"S. Mannor","year":"2003","unstructured":"Mannor, S., Meir, R., Zhang, T.: Greedy algorithms for classification\u2014consistency, convergence rates, and adaptivity. J. Mach. Learn. Res. 4, 713\u2013742 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR22","unstructured":"Mason, L., Bartlett, P., Baxter, J.: Direct optimization of margins improves generalization in combined classifiers. Advances in Neural Information Processing Systems 12. MIT Press, Cambridge (2000)"},{"key":"5_CR23","volume-title":"Functional gradient techniques for combining hypotheses","author":"L. Mason","year":"2000","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Functional gradient techniques for combining hypotheses. Advances in Large Margin Classifiers. MIT Press, Cambridge (2000)"},{"key":"5_CR24","first-page":"131","volume":"9","author":"D. Mease","year":"2008","unstructured":"Mease, D., Wyner, A.: Evidence contrary to the statistical view of boosting. J. Mach. Learn. Res. 9, 131\u2013156 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Onoda, T., R\u00e4tsch, G., M\u00fcller, K.R.: An asymptotic analysis of AdaBoost in the binary classification case. In: Proceedings of the 8th International Conference on Artificial Neural Networks, Sk\u00f6vde, pp. 195\u2013200 (1998)","DOI":"10.1007\/978-1-4471-1599-1_26"},{"key":"5_CR26","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)"},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G., Onoda, T., M\u00fcller, K.R.: Soft margins for AdaBoost. Mach. Learn. 42(3), 287\u2013320 (2001)","journal-title":"Mach. Learn."},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Reyzin, L., Schapire, R.E.: How boosting the margin can also boost classifier complexity. In: Proceedings of the 23rd International Conference on Machine Learning, Pittsburgh (2006)","DOI":"10.1145\/1143844.1143939"},{"key":"5_CR29","first-page":"941","volume":"5","author":"S. Rosset","year":"2004","unstructured":"Rosset, S., Zhu, J., Hastie, T.: Boosting as a regularized path to a maximum margin classifier. J. Mach. Learn. Res. 5, 941\u2013973 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR30","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8291.001.0001","volume-title":"Boosting: Foundations and Algorithms","author":"R.E. Schapire","year":"2012","unstructured":"Schapire, R.E., Freund, Y.: Boosting: Foundations and Algorithms. MIT Press, Cambridge (2012)"},{"issue":"3","key":"5_CR31","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R.E. Schapire","year":"1999","unstructured":"Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence-rated predictions. Mach. Learn. 37(3), 297\u2013336 (1999)","journal-title":"Mach. Learn."},{"issue":"5","key":"5_CR32","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P., Lee, W.S.: Boosting the margin: a new explanation for the effectiveness of voting methods. Ann. Stat. 26(5), 1651\u20131686 (1998)","journal-title":"Ann. Stat."},{"issue":"1","key":"5_CR33","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R. Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. Royal Stat. Soc. B\u00a0(Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. Royal Stat. Soc. B (Methodol.)"},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Prob. Appl. 16(2), 264\u2013280 (1971)","journal-title":"Theory Prob. Appl."},{"key":"5_CR35","volume-title":"Theory of Pattern Recognition","author":"V.N. Vapnik","year":"1974","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: Theory of Pattern Recognition. Nauka, Moscow (1974). (In\u00a0Russian)"},{"key":"5_CR36","first-page":"1835","volume":"12","author":"L. Wang","year":"2011","unstructured":"Wang, L., Sugiyama, M., Jing, Z., Yang, C., Zhou, Z.H., Feng, J.: A refined margin analysis for boosting algorithms via equilibrium margin. J. Mach. Learn. Res. 12, 1835\u20131863 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR37","unstructured":"Wyner, A.J.: On boosting and the exponential loss. In: Proceedings of the 9th International Workshop on Artificial Intelligence and Statistics, Key West (2003)"},{"issue":"1","key":"5_CR38","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1214\/aos\/1079120130","volume":"32","author":"T. Zhang","year":"2004","unstructured":"Zhang, T.: Statistical behavior and consistency of classification methods based on convex risk minimization. Ann. Stat. 32(1), 56\u2013134 (2004)","journal-title":"Ann. Stat."},{"issue":"4","key":"5_CR39","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1214\/009053605000000255","volume":"33","author":"T. Zhang","year":"2005","unstructured":"Zhang, T., Yu, B.: Boosting with early stopping: convergence and consistency. Ann. Stat. 33(4), 1538\u20131579 (2005)","journal-title":"Ann. Stat."},{"key":"5_CR40","first-page":"2701","volume":"8","author":"P. Zhao","year":"2007","unstructured":"Zhao, P., Yu, B.: Stagewise Lasso. J. Mach. Learn. Res. 8, 2701\u20132726 (2007)","journal-title":"Stagewise Lasso. J. Mach. Learn. Res."}],"container-title":["Empirical Inference"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41136-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T10:17:51Z","timestamp":1716286671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-41136-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411359","9783642411366"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41136-6_5","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"9 October 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}