{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:12:58Z","timestamp":1752228778252,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657019"},{"type":"electronic","value":"9783540490975"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49097-3_1","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:28Z","timestamp":1175769148000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":58,"title":["Theoretical Views of Boosting"],"prefix":"10.1007","author":[{"given":"Robert E.","family":"Schapire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P. L. Bartlett","year":"1998","unstructured":"Peter L. Bartlett. The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 44(2):525\u2013536, March 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR2","unstructured":"Eric Bauer and Ron Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, to appear."},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","volume":"1","author":"E. B. Baum","year":"1989","unstructured":"Eric B. Baum and David Haussler. What size net gives valid generalization? Neural Computation, 1(1):151\u2013160, 1989.","journal-title":"Neural Computation"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bernhard E. Boser, Isabelle M. Guyon, and Vladimir N. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pages 144\u2013152, 1992.","DOI":"10.1145\/130385.130401"},{"key":"1_CR5","unstructured":"Leo Breiman. Arcing the edge. Technical Report 486, Statistics Department, University of California at Berkeley, 1997."},{"key":"1_CR6","unstructured":"Leo Breiman. Prediction games and arcing classifiers. Technical Report 504, Statistics Department, University of California at Berkeley, 1997."},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1214\/aos\/1024691079","volume":"26","author":"L. Breiman","year":"1998","unstructured":"Leo Breiman. Arcing classifiers. The Annals of Statistics, 26(3):801\u2013849, 1998.","journal-title":"The Annals of Statistics"},{"issue":"3","key":"1_CR8","first-page":"273","volume":"20","author":"C. Cortes","year":"1995","unstructured":"Corinna Cortes and Vladimir Vapnik. Support-vector networks. Machine Learning, 20(3):273\u2013297, September 1995.","journal-title":"Machine Learning"},{"key":"1_CR9","unstructured":"Thomas G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, to appear."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1613\/jair.105","volume":"2","author":"T. G. Dietterich","year":"1995","unstructured":"Thomas G. Dietterich and Ghulum Bakiri. Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research, 2:263\u2013286, January 1995.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"1_CR11","first-page":"479","volume":"8","author":"H. Drucker","year":"1996","unstructured":"Harris Drucker and Corinna Cortes. Boosting decision trees. In Advances in Neural Information Processing Systems 8, pages 479\u2013485, 1996.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1142\/S0218001493000352","volume":"7","author":"H. Drucker","year":"1993","unstructured":"Harris Drucker, Robert Schapire, and Patrice Simard. Boosting performance in neural networks. International Journal of Pattern Recognition and Artificial Intelligence, 7(4):705\u2013719, 1993.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Yoav Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256\u2013285, 1995.","journal-title":"Information and Computation"},{"key":"1_CR14","unstructured":"Yoav Freund and Robert E. Schapire. Experiments with a new boosting algorithm. In Machine Learning: Proceedings of the Thirteenth International Conference, pages 148\u2013156, 1996."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Yoav Freund and Robert E. Schapire. Game theory, on-line prediction and boosting. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, pages 325\u2013332, 1996.","DOI":"10.1145\/238061.238163"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of online learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119\u2013139, August 1997.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR17","unstructured":"Yoav Freund and Robert E. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, to appear."},{"key":"1_CR18","unstructured":"Jerome Friedman, Trevor Hastie, and Robert Tibshirani. Additive logistic regression: a statistical view of boosting. Technical Report, 1998."},{"key":"1_CR19","unstructured":"Adam J. Grove and Dale Schuurmans. Boosting in the limit: Maximizing the margin of learned ensembles. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 1998."},{"key":"1_CR20","first-page":"654","volume":"8","author":"J. C. Jackson","year":"1996","unstructured":"Jeffrey C. Jackson and Mark W. Craven. Learning sparse perceptrons. In Advances in Neural Information Processing Systems 8, pages 654\u2013660, 1996.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"1_CR21","unstructured":"Michael Kearns and Leslie G. Valiant. Learning Boolean formulae or finite automata is as hard as factoring. Technical Report TR-14-88, Harvard University Aiken Computation Laboratory, August 1988."},{"issue":"1","key":"1_CR22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/174644.174647","volume":"1","author":"M. Kearns","year":"1994","unstructured":"Michael Kearns and Leslie G. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the Association for Computing Machinery, 1(1):67\u201395, January 1994.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1_CR23","unstructured":"Richard Maclin and David Opitz. An empirical evaluation of bagging and boosting. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 546\u2013551, 1997."},{"key":"1_CR24","unstructured":"Llew Mason, Peter Bartlett, and Jonathan Baxter. Direct optimization of margins improves generalization in combined classifiers. Technical report, Deparment of Systems Engineering, Australian National University, 1998."},{"key":"1_CR25","unstructured":"C.J. Merz and P.M. Murphy. UCI repository of machine learning databases, 1998. http:\/\/www.ics.uci.edu\/_mlearn\/MLRepository.html ."},{"key":"1_CR26","unstructured":"J.R. Quinlan. Bagging, boosting, and C4.5. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 725\u2013730, 1996."},{"key":"1_CR27","unstructured":"J. Ross Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993."},{"issue":"2","key":"1_CR28","first-page":"197","volume":"5","author":"R. E. Schapire","year":"1990","unstructured":"Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2): 197\u2013227, 1990.","journal-title":"Machine Learning"},{"key":"1_CR29","unstructured":"Robert E. Schapire. Using output codes to boost multiclass learning problems. In Machine Learning: Proceedings of the Fourteenth International Conference, pages 313\u2013321, 1997."},{"key":"1_CR30","unstructured":"Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. In Machine Learning: Proceedings of the Fourteenth International Conference, pages 322\u2013330, 1997. To appear, The Annals of Statistics."},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Robert E. Schapire and Yoram Singer. Improved boosting algorithms using confidence-rated predictions. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 80\u201391, 1998.","DOI":"10.1145\/279943.279960"},{"key":"1_CR32","unstructured":"Robert E. Schapire and Yoram Singer. BoosTexter: A system for multiclass multi-label text categorization. Machine Learning, to appear."},{"key":"1_CR33","first-page":"647","volume":"10","author":"H. Schwenk","year":"1998","unstructured":"Holger Schwenk and Yoshua Bengio. Training methods for adaptive boosting of neural networks. In Advances in Neural Information Processing Systems 10, pages 647\u2013653, 1998.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"11","key":"1_CR34","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, November 1984.","journal-title":"Communications of the ACM"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Vladimir N. Vapnik. The Nature of Statistical Learning Theory. Springer, 1995.","DOI":"10.1007\/978-1-4757-2440-0"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49097-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T14:27:10Z","timestamp":1736951230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49097-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657019","9783540490975"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-49097-3_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"19 November 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}