Comparison of SOM Point Densities Based on Different Criteria

  • Authors:
  • Teuvo Kohonen

  • Affiliations:
  • Helsinki University of Technology,Neural Networks Research Centre, FIN-02015 HUT, Espoo, Finland

  • Venue:
  • Neural Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Point densities of model (codebook) vectors in self-organizing maps (SOMs) are evaluated in this article. For a few one-dimensional SOMs with finite grid lengths and a given probability density function of the input, the numerically exact point densities have been computed. The point density derived from the SOM algorithm turned out to be different from that minimizing the SOM distortion measure, showing that the model vectors produced by the basic SOM algorithm in general do not exactly coincide with the optimum of the distortion measure. A new computing technique based on the calculus of variations has been introduced. It was applied to the computation of point densities derived from the distortion measure for both the classical vector quantization and the SOM with general but equal dimensionality of the input vectors and the grid, respectively. The power laws in the continuum limit obtained in these cases were found to be identical.