Skip to main content

Bagging, Boosting and Ordinal Classification

  • Conference paper
Classification — the Ubiquitous Challenge

Abstract

Since the introduction of bagging and boosting many new techniques have been developed within the field of classification via aggregation methods. Most of them have in common that the class indicator is treated as a nominal response without any structure. Since in many practical situations the class must be considered as an ordered categorical variable, it seems worthwhile to take this additional information into account. We propose several variants of bagging and boosting, which make use of the ordinal structure and it is shown how the predictive power might be improved. Comparisons are based not only on misclassification rates but also on general distance measures, which reflect the difference between true and predicted class.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BREIMAN, L. (1996): Bagging Predictors. Machine Learning, 24, 123–140.

    MATH  MathSciNet  Google Scholar 

  • BREIMAN, L. (1998): Arcing Classifiers. Annals of Statistics, 26, 801–849.

    Article  MATH  MathSciNet  Google Scholar 

  • BÜHLMANN, P. and YU, B. (2002): Boosting with the L2-Loss: Regression and Classification. To appear in Journal of the American Statistical Association.

    Google Scholar 

  • FREUND, Y (1995): Boosting a Weak Learning Algorithm by Majority. Information And Computation, 121, 256–285.

    Article  MATH  MathSciNet  Google Scholar 

  • FREUND, Y. and SCHAPIRE, R.E. (1996): Experiments with a New Boosting Algorithm. Machine Learning: Proceedings of the Thirteenth International Conference.

    Google Scholar 

  • FRIEDMAN, J., HASTIE, T. and TIBSHIRANI, R. (2000): Additive Logistic Regression: A Statistical View of Boosting. Annals of Statistics, 28, 337–374.

    Article  MathSciNet  Google Scholar 

  • HASTIE, T., TIBSHIRANI, R. and FRIEDMAN, J. (2001): The Elements of Statistical Learning. New York, Spinger.

    Google Scholar 

  • SCHAPIRE, R.E. (2002): The Boosting Approach to Machine Learning: An Overview. MSRI Workshop on Nonlinear Estimation and Classification.

    Google Scholar 

  • TUTZ, G. and HECHENBICHLER, K. (2003): Aggregating Classifiers with Ordinal Response Structure. Discussion Paper 359, SFB 386 der Ludwig-Maximilians-Universität München.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Hechenbichler, K., Tutz, G. (2005). Bagging, Boosting and Ordinal Classification. In: Weihs, C., Gaul, W. (eds) Classification — the Ubiquitous Challenge. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28084-7_14

Download citation

Publish with us

Policies and ethics