Asymptotic Level Density of the Elastic Net Self-Organizing Feature Map
Whileas the Kohonen Self Organizing Map shows an asymptotic level density following a power law with a magnification exponent 2/3, it would be desired to have an exponent 1 in order to provide optimal mapping in the sense of information theory. In this paper, we study analytically and numerically the magnification behaviour of the Elastic Net algorithm as a model for self-organizing feature maps. In contrast to the Kohonen map the Elastic Net shows no power law, but for onedimensional maps nevertheless the density follows an universal magnification law, i.e. depends on the local stimulus density only and is independent on position and decouples from the stimulus density at other positions.
Unable to display preview. Download preview PDF.
- 3.H. Ritter, T. Martinetz, and K. Schulten 1992. Neural Computation and Self-Organizing Maps. Addison-Wesley.Google Scholar
- 8.J. Hertz, A. Krogh, and R. G. Palmer 1991. Intr. to the Theory of Neural Comp. Addison-Wesley, Reading, MA.Google Scholar
- 9.J. C. Claussen (born Gruel) 1992. Diploma thesis, KielGoogle Scholar
- J.C. Claussen (born Gruel) and H. G. Schuster 1994. Preprint.Google Scholar
- 10.T. Kohonen 1991. in: Artificial Neural Networks, ed. T. Kohonen et al. North-Holland, Amsterdam.Google Scholar
- 15.P. D. Simic 1994. Private communication.Google Scholar