Skip to main content

Making Standard SOM Invariant to the Initial Conditions

  • Conference paper
Bio-Inspired Systems: Computational and Ambient Intelligence (IWANN 2009)

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

Included in the following conference series:

Abstract

In data clustering, the assessment of learning properties with respect to data is important for a reliable classification. However, in standard Self Organizing Map (SOM), weight vectors initialization is done randomly, leading to a different final feature map each time the initial conditions are changed. To cope with this issue, in this paper, we present a behavioral study of the first iterations of the learning process in standard SOM. After establishing the mathematical foundations of the first passage of input vectors, we show how to conclude a better initialization relatively to the data set, leading to the generation of a unique feature map.

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
Softcover Book
USD 169.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

  1. Kohonen, T.: Self-Organization and Associative memory, 3rd edn. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  2. Kohonen, T.: Self Organizing Maps. Springer, Berlin (1995)

    Book  MATH  Google Scholar 

  3. Kohonen, T.: The Self-Organization Map. Proceedings of the IEEE 78, 1464–1480 (1990)

    Article  Google Scholar 

  4. Hecht-Nielsen, R.: Counterpropagation networks. Appl. Opt. 26, 4979–4984 (1987)

    Article  Google Scholar 

  5. DeSieno, D.: Adding a conscience to competitive learning. In: IEEE Int. Conf. Neural Networks, San Diego, CA, vol. I, pp. 117–124 (1988)

    Google Scholar 

  6. Huerter, G.: Solution of the traveling salesman problem with an adaptive ring. In: IEEE Int. Conf. Neural Networks, San Diego, CA, pp. 85–92 (1988)

    Google Scholar 

  7. Marzouki, K., Yamakawa, T.: Novel Learning Algorithm Aiming at Generating a Unique Units Distribution in Standard SOM. In: Proceedings of the International Conference on Adaptive and Natural Computing Algorithms, Coimbra, Portugal, pp. 168–172 (2005)

    Google Scholar 

  8. Sadeghi, A.: Asymptotic Behavior of Self-Organizing Maps with Non- Uniform Stimuli Distribution. Annals of Applied Probability 8(1), 281–289 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. http://www.ics.uci.edu/~mlearn/MLRepository.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chikha, S.B., Marzouki, K. (2009). Making Standard SOM Invariant to the Initial Conditions. In: Cabestany, J., Sandoval, F., Prieto, A., Corchado, J.M. (eds) Bio-Inspired Systems: Computational and Ambient Intelligence. IWANN 2009. Lecture Notes in Computer Science, vol 5517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02478-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02478-8_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02477-1

  • Online ISBN: 978-3-642-02478-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics