Skip to main content
SpringerLink
Log in

Fast Computation of Kohonen Self-Organization

  • Conference paper
Neurocomputing

Part of the book series: NATO ASI Series ((NATO ASI F,volume 68))

Abstract

A new computational algorithm, the Probing Algorithm, is introduced for the subproblem of finding the best matching unit in Kohonen’s self-organization procedure. It is compared to exhaustive search and four other algorithms, and shown to be roughly 6 to 10 times faster for the case of high-dimensional vectors.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Friedman J.H, Baskett F. and Shustek L.J.: An Algorithm for Finding Nearest Neighbors, IEEE Trans. Comput., vol C-24, Oct. 1975, 1000–1006

    Article  MATH  Google Scholar 

  2. Fukunaga K. and Narendra P.M.: A Branch and Bound Algorithm for Computing k-nearest Neighbors, IEEE Trans. Comput., vol C-24, July 1975, 750–753

    Article  MATH  MathSciNet  Google Scholar 

  3. Kamgar-Parsi B. and Kanal L.N.; An Improved Branch and Bound Algorithm for Computing k-nearest Neighbors, Pattern Recognition Letters 3, 7–12, 1985

    Article  Google Scholar 

  4. Kim B. S. and Park S. B.: A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition, IEEE Trans. PAMI, vol. PAMI-8, No. 6, Nov. 1986, 761–766

    Article  Google Scholar 

  5. Kohonen T.: Self-Organization and Associative Memory. Springer-Verlag, Berlin, 1988

    MATH  Google Scholar 

  6. Koikkalainen P. and Oja E.: Specification and Implementation Environment for Neural Networks Using Communicating Sequential Processes, Proc. IEEE ICNN-88, San Diego, CA, July 24.-27., 1988, 533–540

    Google Scholar 

  7. Omohundro S. M.: Efficient Algorithms with Neural Network Behavior, Complex Systems 1, Complex Systems Publications, Inc, 1989, 273–347

    Google Scholar 

  8. Yunck T.P.: A Technique to Identify Nearest Neighbors, IEEE Trans. Syst. Man. Cybern., vol SMC-6, Oct. 1976, 678–683

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Technology, Lappeenranta University of Technology, Box 20, SF-53851, Lappeenranta, Finland

    J. Lampinen & E. Oja

Authors
  1. J. Lampinen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Oja
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire de Recherche en Informatique, Université de Paris Sud, Bâtiment 490, F-91405, Orsay Cedex, France

    Françoise Fogelman Soulié

  2. Institut National Polytechnique de Grenoble, LTIRF, 46, avenue FĂ©lix Viallet, F-38031, Grenoble Cedex, France

    Jeanny HĂ©rault

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lampinen, J., Oja, E. (1990). Fast Computation of Kohonen Self-Organization. In: Soulié, F.F., Hérault, J. (eds) Neurocomputing. NATO ASI Series, vol 68. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76153-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76153-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-76155-3

  • Online ISBN: 978-3-642-76153-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation