Advertisement

Comparing self-organizing maps

  • Samuel Kaski
  • Krista Lagus
Poster Presentations 3 Theory V: Self-Organizing Maps
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1112)

Abstract

In exploratory analysis of high-dimensional data the self-organizing map can be used to illustrate relations between the data items. We have developed two measures for comparing how different maps represent these relations. The other combines an index of discontinuities in the mapping from the input data set to the map grid with an index of the accuracy with which the map represents the data set. This measure can be used for determining the goodness of single maps. The other measure has been used to directly compare how similarly two maps represent relations between data items. Such a measure of the dissimilarity of maps is useful, e.g., for analyzing the sensitivity of maps to variations in their inputs or in the learning process. Also the similarity of two data sets can be compared indirectly by comparing the maps that represent them.

Keywords

Data Item Input Space Dissimilarity Measure Exploratory Data Analysis Learning Parameter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bauer, H.-U., Pawelzik, K. R.: Quantifying the neighborhood preservation of self-sorganizing feature maps. IEEE Tr. Neural Networks 3 (1992) 570–579Google Scholar
  2. 2.
    Kaski, S., Kohonen, T.: Exploratory data analysis by the self-organizing map: Structures of welfare and poverty in the world. In Neural Networks in the Capital Markets, World Scientific (to appear)Google Scholar
  3. 3.
    Kiviluoto, K.: Topology preservation in self-organizing maps. In Proc. ICNN96, IEEE Int. Conf. on Neural Networks (to appear)Google Scholar
  4. 4.
    Kohonen, T.: Self-organized formation of topologically correct feature maps. Biol. Cybern. 43 (1982) 59–69Google Scholar
  5. 5.
    Kohonen, T.: Self-Organizing Maps. Springer, Berlin (1995)Google Scholar
  6. 6.
    Kraaijveld, M. A., Mao, J., Jain, A. K.: A non-linear projection method based on Kohonen's topology preserving maps. In Proc. 11ICPR, 11th Int. Conf. on Pattern Recognition. IEEE Comput. Soc. Press., Los Alamitos, CA (1992) 41–45Google Scholar
  7. 7.
    Martinetz, T., Schulten, K.: Topology representing networks. Neural Networks 7 (1994) 507–522Google Scholar
  8. 8.
    Speckmann, H., Raddatz, G., Rosenstiel., W.: Considerations of geometrical and fractal dimension of SOM to get better learning results. In M. Marinaro and P. G. Morasso, eds, Proc. ICANN94, Int. Conf. on Artificial Neural Networks. Springer, London (1994) 342–345Google Scholar
  9. 9.
    Ultsch, A., Siemon, H. P.: Kohonen's self organizing feature maps for exploratory data analysis. In Proc. INNC90, Int. Neural Network Conf. Kluwer, Dordrecht (1990) 305–308Google Scholar
  10. 10.
    Villmann, T., Der, R., Martinetz, T.: A new quantitative measure of topology preservation in Kohonen's feature maps. In Proc. ICNN'94, IEEE Int. Conf. on Neural Networks. IEEE Service Center, Piscataway, NJ (1994) 645–648Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Samuel Kaski
    • 1
  • Krista Lagus
    • 1
  1. 1.Neural Networks Research CentreHelsinki University of TechnologyEspooFinland

Personalised recommendations