Skip to main content

Boosting Unsupervised Competitive Learning Ensembles

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4668))

Abstract

Topology preserving mappings are great tools for data visualization and inspection in large datasets. This research presents a combination of several topology preserving mapping models with some basic classifier ensemble and boosting techniques in order to increase the stability conditions and, as an extension, the classification capabilities of the former. A study and comparison of the performance of some novel and classical ensemble techniques are presented in this paper to test their suitability, both in the fields of data visualization and classification when combined with topology preserving models such as the SOM, ViSOM or ML-SIM.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kohonen, T.: The Self-Organizing Map. Neurocomputing 21, 1–6 (1998)

    Article  MATH  Google Scholar 

  2. Yin, H.: Data Visualisation and Manifold Mapping Using the Visom. Neural Networks 15, 1005–1016 (2002)

    Article  Google Scholar 

  3. Corchado, E., Fyfe, C.: The Scale Invariant Map and Maximum Likelihood Hebbian Learning. In: International Conference on Knowledge-Based & Intelligent Information & Engineering System (KES) (2002)

    Google Scholar 

  4. Breiman, L.: Bagging Predictors. Machine Learning 24, 123–140 (1996)

    MATH  Google Scholar 

  5. Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of on-Line Learning and an Application to Boosting. Journal of Computer and System Sciences 55, 119–139 (1997)

    Article  MATH  Google Scholar 

  6. Kohonen, T., Lehtio, P., Rovamo, J., Hyvarinen, J., Bry, K., Vainio, L.: A Principle of Neural Associative Memory. Neuroscience 2, 1065–1076 (1977)

    Article  Google Scholar 

  7. Yin, H.: Visom - a Novel Method for Multivariate Data Projection and Structure Visualization. Neural Networks, IEEE Transactions 13, 237–243 (2002)

    Article  Google Scholar 

  8. Corchado, E., MacDonald, D., Fyfe, C.: Maximum and Minimum Likelihood Hebbian Learning for Exploratory Projection Pursuit. Data Mining and Knowledge Discovery 8, 203–225 (2004)

    Article  Google Scholar 

  9. Fyfe, C., Corchado, E.: Maximum Likelihood Hebbian Rules. In: European Symposium on Artificial Neural Networks (ESANN) (2002)

    Google Scholar 

  10. Kraaijveld, M.A., Mao, J., Jain, A.K.: A Nonlinear Projection Method Based on Kohonen’s Topology Preserving Maps. Neural Networks, IEEE Transactions 6, 548–559 (1995)

    Article  Google Scholar 

  11. Heskes, T.: Balancing between Bagging and Bumping. In: Advances in Neural Information Processing Systems 9 - Proceedings of the 1996 Conference, vol. 9, pp. 466–472 (1997)

    Google Scholar 

  12. Demiriz, A., Bennett, K.P., Shawe-Taylor, J.: Linear Programming Boosting via Column Generation. Machine Learning 46(1-3), 225–254 (2002)

    Article  MATH  Google Scholar 

  13. Schwenk, H., Bengio, Y.: Boosting Neural Networks. Neural Computation 12, 1869–1887 (2000)

    Article  Google Scholar 

  14. Freund, Y., Schapire, R.E.: Experiments with a New Boosting Algorithm. In: International Conference on Machine Learning, pp. 148–156 (1996)

    Google Scholar 

  15. Gabrys, B., Baruque, B., Corchado, E.: Outlier Resistant PCA Ensembles. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds.) KES 2006. LNCS (LNAI), vol. 4253, pp. 432–440. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Corchado, E., Baruque, B., Gabrys, B.: Maximum Likelihood Topology Preserving Ensembles. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 1434–1442. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Kaski, S.: Data Exploration Using Self-Organizing Maps. Department of Computer Science and Engineering. Helsinki University of Technology. Espoo, Finland (1997)

    Google Scholar 

  18. Petrakieva, L., Fyfe, C.: Bagging and Bumping Self Organising Maps. Computing and Information Systems (2003)

    Google Scholar 

  19. Georgakis, A., Li, H., Gordan, M.: An Ensemble of SOM Networks for Document Organization and Retrieval. In: Int. Conf. on Adaptive Knowledge Representation and Reasoning (AKRR’05), p. 6 (2005)

    Google Scholar 

  20. Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases. University of California, Irvine, Dept. of Information and Computer Sciences (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joaquim Marques de Sá Luís A. Alexandre Włodzisław Duch Danilo Mandic

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corchado, E., Baruque, B., Yin, H. (2007). Boosting Unsupervised Competitive Learning Ensembles. In: de Sá, J.M., Alexandre, L.A., Duch, W., Mandic, D. (eds) Artificial Neural Networks – ICANN 2007. ICANN 2007. Lecture Notes in Computer Science, vol 4668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74690-4_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74690-4_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74689-8

  • Online ISBN: 978-3-540-74690-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics