Skip to main content

Adaptive Boosting: Dividing the Learning Set to Increase the Diversity and Performance of the Ensemble

  • Conference paper
Neural Information Processing (ICONIP 2006)

Abstract

As shown in the bibliography, Boosting methods are widely used to build ensembles of neural networks. This kind of methods increases the performance with respect to a single network. Since Freund and Schapire introduced Adaptive Boosting in 1996 some authors have studied and improved Adaboost. In this paper we present Cross Validated Boosting a method based on Adaboost and Cross Validation. We have applied Cross Validation to the learning set in order to get an specific training set and validation set for each network. With this procedure the diversity increases because each network uses an specific validation set to finish its learning. Finally, we have performed a comparison among Adaboost and Crossboost on eight databases from UCI, the results show that Crossboost is the best performing method.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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

  1. Tumer, K., Ghosh, J.: Error correlation and error reduction in ensemble classifiers. Connection Science 8(3-4), 385–403 (1996)

    Article  Google Scholar 

  2. Raviv, Y., Intratorr, N.: Bootstrapping with noise: An effective regularization technique. Connection Science, Special issue on Combining Estimators 8, 356–372 (1996)

    Google Scholar 

  3. Verikas, A., Lipnickas, A., Malmqvist, K., Bacauskiene, M., Gelzinis, A.: Soft combination of neural classifiers: A comparative study. Pattern Recognition Letters 20(4), 429–444 (1999)

    Article  Google Scholar 

  4. Freund, Y., Schapire, R.E.: Experiments with a new boosting algorithm. In: International Conference on Machine Learning, pp. 148–156 (1996)

    Google Scholar 

  5. Breiman, L.: Arcing classifiers. The Annals of Statistics 26(3), 801–849 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kuncheva, L., Whitaker, C.J.: Using diversity with three variants of boosting: Aggressive. In: Roli, F., Kittler, J. (eds.) MCS 2002. LNCS, vol. 2364, p. 81. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Oza, N.C.: Boosting with averaged weight vectors. In: Windeatt, T., Roli, F. (eds.) MCS 2003. LNCS, vol. 2709, pp. 15–24. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Drucker, H., Cortes, C., Jackel, L.D., LeCun, Y., Vapnik, V.: Boosting and other ensemble methods. Neural Computation 6(6), 1289–1301 (1994)

    Article  MATH  Google Scholar 

  9. Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Torres-Sospedra, J., Hernández-Espinosa, C., Fernández-Redondo, M. (2006). Adaptive Boosting: Dividing the Learning Set to Increase the Diversity and Performance of the Ensemble. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893028_77

Download citation

  • DOI: https://doi.org/10.1007/11893028_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46479-2

  • Online ISBN: 978-3-540-46480-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics