Abstract
The “self-organizing map” method, due to Kohonen, is a well-known neural network method. It is closely related to cluster analysis (partitioning) and other methods of data analysis. In this article, we explore some of these close relationships. A number of properties of the technique are discussed. Comparisons with various methods of data analysis (principal components analysis, k-means clustering, and others) are presented.
Similar content being viewed by others
References
AARTS, E. H. L., and VAN LAARHOVEN, P. J. M. (1987), “Simulated Annealing: A Pedestrian Review of the Theory and Some Applications,” inPattern Recognition Theory and Applications, Eds., P. A. Devijver and J. Kittler, Berlin: Springer-Verlag, 179–192.
ANGÉNIOL, B., DE LA CROIX VAUBOIS, G., and LE TEXIER, J.-Y. (1988), “Self-organizing Feature Maps and the Travelling Salesman Problem,”Neural Networks, 1, 289–293.
ANON. (1993), “1262 Studies of the Self-organizing Map (SOM) and Learning Vector Quantization (LVQ),” Compiled in the Laboratory of Computer and Information Science, Helsinki University of Technology. Available by anonymous ftp from cochlea.hut.fi (130.233.168.48).
ARABIE, P., and HUBERT, L. J. (1990), “The Bond Energy Algorithm Revisited,”IEEE Transactions on Systems, Man, and Cybernetics, 20, 268–274.
BENZÉCRI, J.-P. (1992),Correspondence Analysis Handbook, Basel: Marcel Dekker.
BEZDEK, J. C. (1974), “Cluster validity with fuzzy sets,”Journal of Cybernetics, 3, 58–73.
BEZDEK, J. C. (1976), “A physical interpretation of fuzzy ISODATA,”IEEE Transactions on Systems, Man, and Cybernetics, SMC-6, 387–389.
BLAYO, F., and DEMARTINES, P. (1991), “Data Analysis: How to Compare Kohonen Neural Networks to Other Techniques?” inArtificial Neural Networks, Lecture Notes in Computer Science Vol. 540, Ed., A. Prieto, Berlin: Springer-Verlag, 469–476.
CASASENT, D. P., and BARNARD, E. (1990), “Adaptive-clustering Optical Neural Net,”Applied Optics, 29, 2603–2615.
DARKEN, C. and MOODY, J. (1990), “Fast Adaptive K-means Clustering: Some Empirical Results,”Proceedings International Joint Conference on Neural Networks, San Diego, June 1990, Volume II, New York: IEEE Computer Science Press, 233–238.
DIDAY, E. and Collaborators, 1979,Optimisation en Classification Automatique, Volume 2, Le Chesnay: INRIA.
DIDAY, E., LEMAIRE, J., POUGET, J., and TESTU, F. (1982),Eléments d’Analyse de Données, Paris: Dunod.
FISHER, R. A. (1936), “The Use of Multiple Measurements in Taxonomic Problems,”Annals of Eugenics, 7, 179–188.
FRIEDMAN, H. (1993), personal communication.
GORDON, A. D. (1981),Classification: Methods for the Exploratory Analysis of Multivariate Data, London: Chapman and Hall.
HARTIGAN, J. A. (1972), “Direct Clustering of a Data Matrix,”Journal of the American Statistical Association, 67, 123–129.
HARTIGAN, J. A. (1975),Clustering Algorithms, New York: Wiley.
HARTIGAN, J. A., and WONG, M. A. (1979), “A K-means Clustering Algorithm,”Applied Statistics, 28, 100–108.
HERNÁNDEZ-PAJARES, M. (1993), “Can a Local Bulge be Differentiated?,”Monthly Notices of the Royal Astronomical Society, 264, 1–4.
HERNÁNDEZ-PAJARES, M., CUBARSÍ, R., and FLORIS, J. (1993), “Astronomical Classification of the Hipparcos Input Catalogue,”Proceedings of the 4th Conference of the International Federation of Classification Societies (IFCS’93), Berlin: Springer-Verlag, submitted.
HERNÁNDEZ-PAJARES, M., and MONTE, E. (1991), “Application of the LVQ Neural Method to a Stellar Catalogue,”Artificial Neural Networks, Lecture Notes in Computer Science Vol. 540, Berlin: Springer-Verlag, 422–429.
KATZ, J. O., and ROHLF, F. J. (1973), “Function-point Cluster Analysis,”Systematic Zoology, 22, 295–301.
KITTLER, J. (1976), “A Locally Sensitive Method for Cluster Analysis,”Pattern Recognition, 8, 23–33.
KITTLER, J. (1979), “Comments on ‘Single-link Characteristics of a Mode-seeking Clustering Algorithm’,”Pattern Recognition, 11, 71–73.
KOHONEN, T. (1982), “Self-organized Formation of Topologically Correct Feature Maps,”Biological Cybernetics, 43, 59–69.
KOHONEN, T. (1988), “Self-organizing Topological Maps (with 5 appendices),” inProceedings Connectionism in Perspective: Tutorial, Zurich: University of Zurich.
KOHONEN, T. (1990), “The Self-Organizing Map,”Proceedings of the IEEE, 78, 1464–1480.
KOHONEN, T., KANGAS, J., and LAAKSONEN, J. (1992),SOM_PAK The Self-Organizing Map Program Package, Version 1.0, Oct. 1992, Helsinki University of Technology, Laboratory of Computer and Information Science, Rakentajanaukio 2 C, SF-02150 Espoo, Finland. Available by anonymous ftp from cochlea.hut.fi (130.233.168.48).
LLOYD, S. P. (1957), “Least Squares Quantization in PCM,” Bell Labs. Technical Report. Eventually published inIEEE Transactions on Information Theory, IT-28, 1982, 129–137.
MCCORMICK Jr., W. T., SCHWEITZER, P. J., and WHITE, T. W. (1972), “Problem Decomposition and Data Reorganization by a Clustering Technique,”Operations Research, 20, 992–1009.
MACQUEEN, J. (1967), “Some Methods for Classification and Analysis of Multivariate Observations,” inMathematics, Statistics and Probability: 5th Berkeley Symposium, Volume 1, Eds., L. M. LeCam and J. Neyman, Berkeley, California: University of California Press, 281–297.
MILLIGAN, G. W. and COOPER, M. C. (1988), “A Study of Standardization of Variables in Cluster Analysis,”Journal of Classification, 5, 181–205.
MURTAGH, F. (1985),Multidimensional Clustering Algorithms, Würzburg and Vienna: Physica-Verlag.
NARENDRA, P. M. and GOLDBERG, M. (1980), “Image Segmentation with Directed Trees,”IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-2, 185–191.
SAMMON, J. W. (1969), “A Nonlinear Mapping for Data Structure Analysis,”IEEE Transactions on Computers, C-18, 401–409.
SCHALKOFF, R. J. (1989),Digital Image Processing and Computer Vision, New York: Wiley.
SHAFFER, E., DUBES, R., and JAIN, A. K. (1979), “Single-link Characteristics of a Modeseeking Clustering Algorithm,”Pattern Recognition, 11, 65–70.
SHEPARD, R. N., and CARROLL, J. D. (1966), “Parametric Representation of Nonlinear Data Structures,” inMultivariate Analysis, Ed., Krishnaiah, New York: Academic Press, 561–592.
SPÄTH, H. (1985),Cluster Dissection and Analysis, Chichester. Ellis Horwood.
S-PLUS, Statistical Sciences Inc., 1700 Westlake Ave., N., Suite 500, Seattle, WA 98109, USA. Email: mktg@statsci.com
TRON, C., and INCA Consortium (1992): “The Hipparcos Input Catalogue,”Bulletin d’Information du Centre de Données Astronomiques de Strasbourg, No. 41, 9–20.
ULTSCH, A. (1993a), “Knowledge Extraction from Self-organizing Neural Networks,” inInformation and Classification, Eds., O. Opitz, B. Lausen and R. Klar, Berlin: Springer-Verlag, 301–306.
ULTSCH, A. (1993b), “Self-organizing Neural Networks for Visualization and Classification,” inInformation and Classification, Eds., O. Opitz, B. Lausen and R. Klar, Berlin: Springer-Verlag, 307–313.
VARFIS, A., and VERSINO, C. (1992), “Clustering of Socio-economic Data with Kohonen Maps,”Neural Network World, 2, 813–833.
Author information
Authors and Affiliations
Additional information
This work has been partially supported for M. Hernández-Pajares by the DGCICIT of Spain under grant No. PB90-0478 and by a CESCA-1993 computer-time grant. Fionn Murtagh is affiliated to the Astrophysics Division, Space Science Department, European Space Agency.
Rights and permissions
About this article
Cite this article
Murtagh, F., Hernández-Pajares, M. The Kohonen self-organizing map method: An assessment. Journal of Classification 12, 165–190 (1995). https://doi.org/10.1007/BF03040854
Issue Date:
DOI: https://doi.org/10.1007/BF03040854