{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:29:23Z","timestamp":1780054163132,"version":"3.54.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1023\/a:1013685603443","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T17:11:47Z","timestamp":1040663507000},"page":"153-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":141,"title":["Boosting Methods for Regression"],"prefix":"10.1007","volume":"47","author":[{"given":"Nigel","family":"Duffy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Helmbold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"391588_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural network learning: Theoretical foundations","author":"M. Anthony","year":"1999","unstructured":"Anthony, M., & Bartlett, P. L. (1999). Neural network learning: Theoretical foundations. Cambridge: Cambridge University Press."},{"key":"391588_CR2","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"A. R. Barron","year":"1993","unstructured":"Barron, A. R. (1993). Universal approximation bounds for superposition of a sigmoidal function. IEEE Trans. on Information Theory, 39, 930\u2013945.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1\/2","key":"391588_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E. Bauer","year":"1999","unstructured":"Bauer, E., & Kohavi, R. (1999). An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning, 36: 1\/2, 105\u201339.","journal-title":"Machine Learning"},{"key":"391588_CR4","first-page":"343","volume-title":"Proceedings ICANN'97, Int. Conf. on Artificial Neural Networks","author":"A. Bertoni","year":"1997","unstructured":"Bertoni, A., Campadelli, P., & Parodi, M. (1997). Aboosting algorithm for regression. In W. Gerstner, A. Germond, M. Hasler, and J.-D. Nicoud (Eds.), Proceedings ICANN'97, Int. Conf. on Artificial Neural Networks (pp. 343\u2013348). Berlin: Springer. Vol. V of LNCS."},{"key":"391588_CR5","unstructured":"Blake, C. E. K., & Merz, C. (1998). UCI repository of machine learning databases."},{"issue":"2","key":"391588_CR6","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"Breiman, L. (1996). Bagging predictors. Machine Learning, 24:2, 123\u2013140.","journal-title":"Machine Learning"},{"issue":"3","key":"391588_CR7","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":"391588_CR8","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L. Breiman","year":"1999","unstructured":"Breiman, L. (1999). Prediction games and arcing algorithms. Neural Computation, 11, 1493\u20131517.","journal-title":"Neural Computation"},{"key":"391588_CR9","volume-title":"Classification and regression trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984). Classification and regression trees. Belmont, CA: Wadsworth International Group."},{"key":"391588_CR10","first-page":"258","volume-title":"Advances in neural information processing systems, 12","author":"N. Duffy","year":"2000","unstructured":"Duffy, N., & Helmbold, D. (2000). Potential boosters? In S. Solla, T. Leen, & K.-R. M\u00fcller (Eds.), Advances in neural information processing systems, 12 (pp. 258\u2013264) Cambridge, MA: MIT Press."},{"key":"391588_CR11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-49097-3_3","volume-title":"Computational learning theory: 4th European Conference (EuroCOLT '99)","author":"N. Duffy","year":"1999","unstructured":"Duffy, N. & Helmbold, D. (1999). A geometric approach to leveraging weak learners. In P. Fischer, & H. U. Simon (Eds.), Computational learning theory: 4th European Conference (EuroCOLT '99) (pp. 18\u201333). Berlin: Springer-Verlag."},{"issue":"2","key":"391588_CR12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y. (1995). Boosting a weak learning algorithm by majority. Information and Computation, 121:2, 256\u2013285.","journal-title":"Information and Computation"},{"key":"391588_CR13","first-page":"102","volume-title":"Proc. 12th Annu. Conf. on Comput. Learning Theory","author":"Y. Freund","year":"1999","unstructured":"Freund, Y. (1999). An adaptive version of the boost by majority algorithm. In Proc. 12th Annu. Conf. on Comput. Learning Theory (pp. 102\u2013113). New York, NY: ACM Press."},{"key":"391588_CR14","first-page":"148","volume-title":"Proc. 13th International Conference on Machine Learning","author":"Y. Freund","year":"1996","unstructured":"Freund, Y., & Schapire, R. E. (1996). Experiments with a new Boosting algorithm. In Proc. 13th International Conference on Machine Learning (pp. 148\u2013156). San Matco, CA: Morgan Kaufmann."},{"issue":"1","key":"391588_CR15","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":"391588_CR16","series-title":"Technical Report","volume-title":"Greedy function approximation: A gradient boosting machine","author":"J. H. Friedman","year":"1999","unstructured":"Friedman, J. H. (1999a). Greedy function approximation: A gradient boosting machine. Technical Report, Department of Statistics, Sequoia Hall, Stanford University, Stanford California 94305."},{"key":"391588_CR17","series-title":"Technical Report","volume-title":"Stochastic gradient boosting","author":"J. H. Friedman","year":"1999","unstructured":"Friedman, J. H. (1999b). Stochastic gradient boosting. Technical Report, Department of Statistics, Sequoia Hall, Stanford University, Stanford California 94305."},{"issue":"2","key":"391588_CR18","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J. Friedman","year":"2000","unstructured":"Friedman, J., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 28:2, 337\u2013374.","journal-title":"The Annals of Statistics"},{"key":"391588_CR19","first-page":"107","volume-title":"Proceedings of the Fourteenth International Converence on Machine Learning","author":"H. Drucker","year":"1997","unstructured":"Drucker, H. (1997). Improving regressors using boosting techniques. In Proceedings of the Fourteenth International Converence on Machine Learning (pp. 107\u2013115). San Matco, CA: Morgan-Kaufman."},{"key":"391588_CR20","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/aos\/1176348546","volume":"20","author":"L. K. Jones","year":"1992","unstructured":"Jones, L. K. (1992). Asimple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training. The Annals of Statistics, 20, 608\u2013613.","journal-title":"The Annals of Statistics"},{"issue":"1","key":"391588_CR21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., & Valiant, L. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM, 41:1, 67\u201395.","journal-title":"Journal of the ACM"},{"key":"391588_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An introduction to computational learning theory","author":"M. J. Kearns","year":"1994","unstructured":"Kearns, M. J., & Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge, MA: The MIT Press."},{"key":"391588_CR23","first-page":"369","volume-title":"Proc. 8th Annu. Conf. on Comput. Learning Theory","author":"W. S. Lee","year":"1995","unstructured":"Lee, W. S., Bartlett, P. L., & Williamson, R. C. (1995). On efficient agnostic learning of linear combinations of basis functions. In Proc. 8th Annu. Conf. on Comput. Learning Theory (pp. 369\u2013376). New York, NY: ACM Press."},{"key":"391588_CR24","first-page":"512","volume-title":"Advances in neural information processing systems, 12","author":"L. Mason","year":"2000","unstructured":"Mason, L., Baxter, J., Bartlett, P., & Frean, M. (2000). Boosting algorithms as gradient descent. In S. Solla, T. Leen, & K.-R. M\u00fcller (Eds.), Advances in neural information processing systems, 12 (pp. 512\u2013518). Cambridge, MA: MIT Press."},{"key":"391588_CR25","first-page":"725","volume-title":"Proceedings of the Thirteenth National Conference of Artificial Intelligence","author":"J. R. Quinlan","year":"1996","unstructured":"Quinlan, J. R. (1996). Bagging, Boosting and C4.5. In Proceedings of the Thirteenth National Conference of Artificial Intelligence (pp. 725\u2013730). Cambridge, MA: AAAI Press MIT Press."},{"issue":"3","key":"391588_CR26","doi-asserted-by":"crossref","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. (2001). Soft margins for AdaBoost'. Machine Learning, 42:3, 287\u2013320.","journal-title":"Machine Learning"},{"key":"391588_CR27","first-page":"170","volume-title":"Proc. 13th Annu. Conference on Comput. Learning Theory","author":"G. R\u00e4tsch","year":"2000","unstructured":"R\u00e4tsch, G., Warmuth, M., Mika, S., Onoda, T., Lemm, S., & M\u00fcller, K. R. (2000). Barrier Boosting. In Proc. 13th Annu. Conference on Comput. Learning Theory (pp. 170\u2013179). San Francisco: Morgan Kaufmann."},{"key":"391588_CR28","unstructured":"Ridgeway, G., Madigan, D., & Richardson, T. (1999). Boosting methodology for regression problems. In D. Heckerman, & J. Whittaker (Eds.), Proc. Artificial Intelligence and Statistics (pp. 152-161)."},{"key":"391588_CR29","volume-title":"The design and analysis of efficient learning algorithms","author":"R. E. Schapire","year":"1992","unstructured":"Schapire, R. E. (1992). The design and analysis of efficient learning algorithms. Cambridge, MA: MIT Press."},{"issue":"5","key":"391588_CR30","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"},{"issue":"3","key":"391588_CR31","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R. E. Schapire","year":"1999","unstructured":"Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37:3, 297\u2013336.","journal-title":"Machine Learning"},{"issue":"11","key":"391588_CR32","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Commun. ACM, 27:11, 1134\u20131142.","journal-title":"Commun. ACM"},{"key":"391588_CR33","volume-title":"Statistical learning theory","author":"V. N. Vapnik","year":"1998","unstructured":"Vapnik, V. N. (1998). Statistical learning theory. New York: Wiley."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013685603443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013685603443\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013685603443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:32:55Z","timestamp":1752147175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013685603443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":33,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["391588"],"URL":"https:\/\/doi.org\/10.1023\/a:1013685603443","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,5]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}