{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:11:26Z","timestamp":1775283086555,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"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":["Machine Learning"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1023\/a:1007614523901","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T05:54:50Z","timestamp":1040536490000},"page":"297-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1925,"title":["Improved Boosting Algorithms Using Confidence-rated Predictions"],"prefix":"10.1007","volume":"37","author":[{"given":"Robert E.","family":"Schapire","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"241752_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P.L. Bartlett","year":"1998","unstructured":"Bartlett, P.L. (1998). 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.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1\/2","key":"241752_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E. Bauer","year":"1999","unstructured":"Bauer, E., & Kohavi, R. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36(1\/2): 105\u2013139, 1999.","journal-title":"Machine Learning"},{"issue":"1","key":"241752_CR3","doi-asserted-by":"crossref","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. (1989). What size net gives valid generalization? Neural Computation, 1(1), 151\u2013160.","journal-title":"Neural Computation"},{"key":"241752_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1007335615132","volume":"26","author":"A. Blum","year":"1997","unstructured":"Blum, A. (1997). Empirical support for winnow and weighted-majority based algorithms: results on a calendar scheduling domain. Machine Learning, 26, 5\u201323.","journal-title":"Machine Learning"},{"issue":"3","key":"241752_CR5","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1214\/aos\/1024691079","volume":"26","author":"L. Breiman","year":"1998","unstructured":"Breiman, L. (1998). Arcing classifiers. The Annals of Statistics, 26(3), 801\u2013849.","journal-title":"The Annals of Statistics"},{"key":"241752_CR6","first-page":"205","volume":"1","author":"I. Csisz\u00e1r","year":"1984","unstructured":"Csisz\u00e1r, I., & Tusn\u00e1dy, G. (1984). Information geometry and alternaning minimization procedures. Statistics and Decisions, Supplement Issue, 1, 205\u2013237.","journal-title":"Statistics and Decisions, Supplement Issue"},{"key":"241752_CR7","unstructured":"Dietterich, T.G. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, to appear."},{"key":"241752_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1613\/jair.105","volume":"2","author":"T.G. Dietterich","year":"1995","unstructured":"Dietterich, T.G., & Bakiri, G. (1995). Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research, 2, 263\u2013286.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"241752_CR9","unstructured":"Drucker, H., & Cortes, C. (1996). Boosting decision trees. In Advances in Neural Information Processing Systems, 8, MIT Press."},{"key":"241752_CR10","unstructured":"Fletcher, R. (1987). Practical Methods of Optimization (second edition), John Wiley."},{"key":"241752_CR11","unstructured":"Freund, Y., Iyer, R., Schapire, R.E., & Singer, Y. (1998). An efficient boosting algorithm for combining preferences. Machine Learning: Proceedings of the Fifteenth International Conference."},{"key":"241752_CR12","unstructured":"Freund, Y., & Schapire, R.E. (1996). Experiments with a new boosting algorithm. Machine Learning: Proceedings of the Thirteenth International Conference (pp. 148\u2013156)."},{"issue":"1","key":"241752_CR13","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":"241752_CR14","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R.E., Singer, Y., & Warmuth, M.K. (1997). Using and combining predictors that specialize. Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing (pp. 334\u2013343).","DOI":"10.1145\/258533.258616"},{"key":"241752_CR15","unstructured":"Friedman, J., Hastie, T., & Tibshirani, R. (1998). Additive logistic regression: A statistical view of boosting Technical Report."},{"issue":"1","key":"241752_CR16","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","volume":"100","author":"D. Haussler","year":"1992","unstructured":"Haussler, D. (1992). Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1), 78\u2013150.","journal-title":"Information and Computation"},{"issue":"2","key":"241752_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0097-3165(95)90001-2","volume":"71","author":"D. Haussler","year":"1995","unstructured":"Haussler, D., & Long, P.M. (1995). A generalization of Sauer's lemma. Journal of Combinatorial Theory, Series A, 71(2), 219\u2013240.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"241752_CR18","doi-asserted-by":"crossref","unstructured":"Kearns, M., & Mansour, Y. (1996). On the boosting ability of top-down decision tree learning algorithms. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing.","DOI":"10.1145\/237814.237994"},{"key":"241752_CR19","unstructured":"Maclin, R., & Opitz, D. (1997). An empirical evaluation of bagging and boosting. Proceedings of the Fourteenth National Conference on Artificial Intelligence (pp. 546\u2013551)."},{"key":"241752_CR20","unstructured":"Margineantu, D.D., & Dietterich, T.G. (1997). Pruning adaptive boosting. Machine Learning: Proceedings of the Fourteenth International Conference (pp. 211\u2013218)."},{"key":"241752_CR21","unstructured":"Merz, C.J., & Murphy, P.M. (1998). UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html."},{"key":"241752_CR22","unstructured":"Quinlan, J.R. (1996). Bagging, boosting, and C4.5. Proceedings of the Thirteenth National Conference on Artificial Intelligence (pp. 725\u2013730)."},{"key":"241752_CR23","unstructured":"Schapire, R.E. (1997). Using output codes to boost multiclass learning problems. Machine Learning: Proceedings of the Fourteenth International Conference (pp. 313\u2013321)."},{"issue":"5","key":"241752_CR24","first-page":"1651","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P., & Lee, W.S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26(5), 1651\u20131686.","journal-title":"The Annals of Statistics"},{"key":"241752_CR25","unstructured":"Schapire, R.E., & Singer, Y. BoosTexter: A boosting-based system for text categorization. Machine Learning, to appear."},{"key":"241752_CR26","unstructured":"Schwenk, H., & Bengio, Y. (1998). Training methods for adaptive boosting of neural networks. In Advances in Neural Information Processing Systems 10. MIT Press."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007614523901.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007614523901\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007614523901.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:36:41Z","timestamp":1752147401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007614523901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["241752"],"URL":"https:\/\/doi.org\/10.1023\/a:1007614523901","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}