{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T19:55:42Z","timestamp":1760644542019},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4034,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0304-3975(01)00083-4","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T08:41:01Z","timestamp":1034325661000},"page":"67-108","source":"Crossref","is-referenced-by-count":10,"title":["A geometric approach to leveraging weak learners"],"prefix":"10.1016","volume":"284","author":[{"given":"Nigel","family":"Duffy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Helmbold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00083-4_BIB1","doi-asserted-by":"crossref","unstructured":"N. Abe, J. Takeuchi, M.K. Warmuth, Polynomial learnability of probabilistic concepts with respect to the Kullback\u2013Leibler divergence, Proc. 4th Annu. Workshop on Comput. Learning Theory, Morgan Kaufmann, San Mateo, CA, 1991, pp. 277\u2013289.","DOI":"10.1016\/B978-1-55860-213-7.50029-8"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00083-4_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","article-title":"An empirical comparison of voting classification algorithms: Bagging, boosting and variants","volume":"36","author":"Bauer","year":"1999","journal-title":"Mach. Learning"},{"issue":"1","key":"10.1016\/S0304-3975(01)00083-4_BIB3","first-page":"151","volume":"1","author":"Baum","year":"1989","journal-title":"What size net gives valid generalization? Neural Comput."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB4","doi-asserted-by":"crossref","unstructured":"B.E. Boser, I.M. Guyon, V.N. Vapnik, A training algorithm for optimal margin classifiers, Proc. 5th Annu. Workshop on Comput. Learning Theory, ACM Press, New York, NY, 1992, pp. 144\u2013152.","DOI":"10.1145\/130385.130401"},{"issue":"2","key":"10.1016\/S0304-3975(01)00083-4_BIB5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00058655","article-title":"Bagging predictors","volume":"24","author":"Breiman","year":"1996","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB6","unstructured":"L. Breiman, Arcing the edge, Tech. Report 486, Department of Statistics, University of California, Berkeley, 1997. Available at www.stat.berkeley.edu."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB7","unstructured":"L. Breiman, Bias, variance, arcing classifiers, Tech. Report 460, Department of Statistics, University of California, Berkeley, 1997. Available at www.stat.berkeley.edu."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB8","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1162\/089976699300016106","article-title":"Prediction games and arcing algorithms","volume":"11","author":"Breiman","year":"1999","journal-title":"Neural Comput."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB9","unstructured":"L. Breiman, J.H. Friedman, R.A. Olshen, C.J. Stone, Classification Regression Trees, Wadsworth International Group, 1984."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB10","unstructured":"E. Keogh, C. Blake, C.J. Merz, UCI repository of machine learning databases, 1998."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB11","doi-asserted-by":"crossref","unstructured":"J. Dougherty, R. Kohavi, M. Sahami, Supervised and unsupervised discretization of continuous features, Proc. 12th Internat. Conf. on Machine Learning, Morgan Kaufmann, 1995, pp. 194\u2013202.","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB12","series-title":"Advances in Neural Information Processing Systems 12","first-page":"258","article-title":"Potential boosters?","author":"Duffy","year":"2000"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB13","unstructured":"S.E. Fahlman, C. Lebiere, The Cascade-Correlation learning architecture, Tech. Report CMU-CS-90-100, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1990."},{"issue":"2","key":"10.1016\/S0304-3975(01)00083-4_BIB14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/inco.1995.1136","article-title":"Boosting a weak learning algorithm by majority","volume":"121","author":"Freund","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB15","doi-asserted-by":"crossref","unstructured":"Y. Freund, An adaptive version of the boost-by-majority algorithm, Proc. 12th Annu. Conf. on Comput. Learning Theory, ACM, 1999, pp. 102\u2013113.","DOI":"10.1145\/307400.307419"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB16","unstructured":"Y. Freund, R.E. Schapire, Experiments with a new boosting algorithm, Proc. 13th Internat. Conf. on Machine Learning, Morgan Kaufmann, 1996, pp. 148\u2013156."},{"issue":"1","key":"10.1016\/S0304-3975(01)00083-4_BIB17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","article-title":"A decision-theoretic generalization of online learning and an application to boosting","volume":"55","author":"Freund","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB18","unstructured":"J. Friedman, T. Hastie, R. Tibshirani, Additive logistic regression: a statistical view of boosting, Tech. Report, Department of Statistics, Sequoia Hall, Stanford University, Stanford California 94305, 1998."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB19","unstructured":"J.H. Friedman, Stochastic gradient boosting, Tech. Report, Department of Statistics, Sequoia Hall, Stanford University, Stanford California 94305, 1999."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB20","doi-asserted-by":"crossref","unstructured":"A.J. Grove, N. Littlestone, D. Schuurmans, General convergence results for linear discriminant updates, Proc. 10th Annu. Conf. on Comput. Learning Theory, ACM, 1997, pp. 171\u2013183.","DOI":"10.1145\/267460.267493"},{"issue":"2","key":"10.1016\/S0304-3975(01)00083-4_BIB21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","article-title":"Equivalence of models for polynomial learnability","volume":"95","author":"Haussler","year":"1991","journal-title":"Inform. Comput."},{"issue":"6","key":"10.1016\/S0304-3975(01)00083-4_BIB22","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1145\/195613.195656","article-title":"Cryptographic limitations on learning Boolean formulae and finite automata","volume":"41","author":"Kearns","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB23","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","year":"1994"},{"issue":"1","key":"10.1016\/S0304-3975(01)00083-4_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","article-title":"Additive versus exponentiated gradient updates for linear prediction","volume":"132","author":"Kivinen","year":"1997","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB25","doi-asserted-by":"crossref","unstructured":"J. Kivinen, M.K. Warmuth, Boosting as entropy projection, Proc. 12th Annu. Conf. on Comput. Learning Theory, ACM, 1999, pp. 134\u2013144.","DOI":"10.1145\/307400.307424"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB26","doi-asserted-by":"crossref","unstructured":"J. Lafferty, Additive models, boosting, inference for generalized divergences, Proc. 12th Annu. Conf. on Comput. Learning Theory, ACM, 1999, pp. 125\u2013133.","DOI":"10.1145\/307400.307422"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB27","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB28","series-title":"Advances in Neural Information Processing Systems 11","first-page":"281","article-title":"Direct optimization of margins improves generalization in combined classifiers","author":"Mason","year":"1999"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB29","series-title":"Advances in Neural Information Processing Systems 12","first-page":"512","article-title":"Boosting algorithms as gradient descent","author":"Mason","year":"2000"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB30","unstructured":"J.R. Quinlan, Bagging, Boosting and C4.5., Proc. 13th National Conf. Artificial Intelligence, AAAI Press and the MIT Press, 1996, pp. 725\u2013730."},{"key":"10.1016\/S0304-3975(01)00083-4_BIB31","doi-asserted-by":"crossref","unstructured":"G. R\u00e4tsch, T. Onoda, K.-R. M\u00fcller, Soft margins for adaboost, Tech. Report NC-TR-1998-021, NeuroCOLT2, 1998.","DOI":"10.1007\/978-1-4471-1599-1_26"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB32","series-title":"The Design and Analysis of Efficient Learning Algorithms","author":"Schapire","year":"1992"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB33","doi-asserted-by":"crossref","unstructured":"R.E. Schapire, Drifting games, Proc. 12th Annu. Conf. on Comput. Learning Theory, ACM, 1999, pp. 114\u2013124.","DOI":"10.1145\/307400.307421"},{"issue":"5","key":"10.1016\/S0304-3975(01)00083-4_BIB34","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1214\/aos\/1024691352","article-title":"Boosting the margin: a new explanation for the effectiveness of voting methods","volume":"26","author":"Schapire","year":"1998","journal-title":"Ann. Statist."},{"issue":"3","key":"10.1016\/S0304-3975(01)00083-4_BIB35","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","article-title":"Improved boosting algorithms using confidence-rated predictions","volume":"37","author":"Schapire","year":"1999","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB36","doi-asserted-by":"crossref","unstructured":"J. Shawe-Taylor, N. Cristianini, Margin distribution bounds on generalization, Proc. Fourth European Conf. Comput. Learning Theory, 1999, pp. 263\u2013273.","DOI":"10.1007\/3-540-49097-3_21"},{"issue":"11","key":"10.1016\/S0304-3975(01)00083-4_BIB37","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(01)00083-4_BIB38","series-title":"Estimation of Dependences Based on Empirical Data","author":"Vapnik","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000834?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000834?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T02:53:59Z","timestamp":1554951239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0304397501000834"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00083-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}