Skip to main content

On the distribution of feature space in Self-Organising mapping and convergence accelerating by a Kalman algorithm

  • Conference paper
  • First Online:
Book cover New Trends in Neural Computation (IWANN 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 686))

Included in the following conference series:

Abstract

In this paper we present a detailed investigation of the statistical and convergence properties of the Kohonen's Self-Organising Mapping (SOM) in any dimension. Using an extend Central Limit Theorem, we prove that the feature space in SOM learning is an approximation to multiple Gausssian distributed stochastic processes, which will eventually converge in the meansquare sense to the density centres of the input probabilistic sub-spaces. We also demonstrate that combining the SOM with a Kalman filter can smooth and accelerate the learning and convergence of the SOM. In our applications, we show that such a modified SOM achieves a much better performance, namely a lower distortion than the original algorithm, especially in early training stages, and at low extra computational cost. This modification will be particular useful when the available training set is small.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Allinson, N. M. 1990. Self-organising maps and their applications. Theory and Applications of Neural networks. J. G. Taylor and C. L. T. Mannion eds. London, Springer-Verlay. 101–118.

    Google Scholar 

  • Bauer, H.-U., and Pawelzik, K. R. 1992. Quantifying the neighborhood preservation of self-organizing feature maps. IEEE Trans. Neural Networks 3(4), 570–579.

    Google Scholar 

  • Cho, C.-M., and Don, H.-S. 1991. A parallel Kalman algorithm for fast learning of multilayer neural networks. Proc. IJCNN-91 (Singapore), 2044–2049.

    Google Scholar 

  • Erwin, E., Obermayer, K., and Schulten, K. 1992a. Self-organizing maps: ordering, convergence properties and energy functions. Biol. Cybern. 67, 47–55.

    Google Scholar 

  • -1992b. Self-organizing maps: stationary states, metastability and convergence rate. Biol. Cybern. 67, 35–45.

    Google Scholar 

  • Kohonen, T. 1982. Self-organized formation of topologically correct feature maps. Biol. Cybern. 43, 59–69.

    Google Scholar 

  • -1984. Self-Organization and Associative Memory. Springer-Verlay.

    Google Scholar 

  • -1991. Self-Organizing Maps: Optimization Approaches. Artificial Neural Networks. Elsevier. 981–990.

    Google Scholar 

  • Lo, Z. P., and Bavarian, B. 1991. On the rate of convergence in topology preserving neural network. Biol. Cybern. 65, 55–63.

    Google Scholar 

  • Ritter, H. and Schulten, K. 1988. Convergence properties of Kohonen's topology conserving maps: Fluctuations, stability, and dimension selection. Biol. Cybern. 60. 59–71.

    Google Scholar 

  • Ruck, D. W., Rogers, S. K., Kabrisky, M., Maybeck, P. S., and Oxley, M. E. 1992. Comparative analysis of backpropagation and the extended Kalman filter for training multilayer perceptrons. IEEE Trans. PAMI-14(6), 686–691.

    Google Scholar 

  • Yin, H. and Allinson, N. M. 1992. Stochastic Analysis and Treatment of the Kohonen's Self-Organising Map.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Mira Joan Cabestany Alberto Prieto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yin, H., Allinson, N.M. (1993). On the distribution of feature space in Self-Organising mapping and convergence accelerating by a Kalman algorithm. In: Mira, J., Cabestany, J., Prieto, A. (eds) New Trends in Neural Computation. IWANN 1993. Lecture Notes in Computer Science, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56798-4_162

Download citation

  • DOI: https://doi.org/10.1007/3-540-56798-4_162

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56798-1

  • Online ISBN: 978-3-540-47741-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics