The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Clustering of the self-organizing map
Abstract
The self-organizing map (SOM) is an excellent tool in exploratory phase of data mining. It projects input space on prototypes of a low-dimensional regular grid that can be effectively utilized to visualize and explore properties of the data. When the number of SOM units is large, to facilitate quantitative analysis of the map and the data, similar units need to be grouped, i.e., clustered. In this paper, different approaches to clustering of the SOM are considered. In particular, the use of hierarchical agglomerative clustering and partitive clustering using k-means are investigated. The two-stage procedure--first using SOM to produce the prototypes that are then clustered in the second stage--is found to perform well when compared with direct clustering of the data and to reduce the computation time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
Kruskal, J. B. (1964) · Psychometrika · doi:10.1007/bf02289565 · Cited by 7,317
Nonmetric Multidimensional Scaling: A Numerical Method
Kruskal, J. B. (1964) · Psychometrika · doi:10.1007/bf02289694 · Cited by 4,846
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
An Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
A Nonlinear Mapping for Data Structure Analysis
Sammon, J. W. (1969) · IEEE Transactions on Computers · doi:10.1109/t-c.1969.222678 · Cited by 3,380
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
Data preparation for data mining
Pyle, D. (1999) · Cited by 1,368
Some new indexes of cluster validity
Bezdek, J. C., & Pal, N. R. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.678624 · Cited by 1,132
Self organization of a massive document collection
Kohonen, T., Kaski, S., Lagus, K., Salojarvi, J., Honkela, J., Paatero, V., & Saarela, A. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846729 · Cited by 908
Asymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
SOM-based data visualization methods
Vesanto, J. (1999) · Intelligent Data Analysis · doi:10.3233/ida-1999-3203 · Cited by 851
Self-citationCurvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets
Demartines, P., & Herault, J. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.554199 · Cited by 649
Kohonen's Self Organizing Feature Maps for Exploratory Data Analysis
Ultsch, A. (1990) · Medical Entomology and Zoology · Cited by 560
Superparamagnetic Clustering of Data
Blatt, M., Wiseman, S., & Domany, E. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3251 · Cited by 537
Asymptotic quantization error of continuous signals and the quantization dimension
Zador, P. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056490 · Cited by 530
Fuzzy models for pattern recognition : methods that search for structures in data
Bezdek, J. C., & Pal, S. K. (1992) · Institute of Electrical and Electronics Engineers eBooks · Cited by 478
A comparison of SOM neural network and hierarchical clustering methods
Mangiameli, P. M., Chen, S. K., & West, D. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(96)00038-0 · Cited by 357
Variants of self-organizing maps
Kangas, J. A., Kohonen, T. K., & Laaksonen, J. T. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80208 · Cited by 325
Clustering properties of hierarchical self-organizing maps
Lampinen, J., & Oja, E. (1992) · Journal of Mathematical Imaging and Vision · doi:10.1007/bf00118594 · Cited by 191
Clustering Properties of Hierarchical Self-Organizing Maps
Lampinen, J., & Oja, E. (1993) · Mathematical Nonlinear Image Processing · doi:10.1007/978-1-4615-3148-7_12 · Cited by 178
SELF-ORGANIZING MAPS: OPHMIZATION APPROACHES
Kohonen, T. (1991) · Elsevier eBooks · doi:10.1016/b978-0-444-89178-5.50003-8 · Cited by 131
Asymptotic level density for a class of vector quantization processes
Ritter, H. J. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80310 · Cited by 115
Lawrence, R. D., Almasi, G. S., & Rushmeier, H. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009817804059 · Cited by 104
Phase transitions in stochastic self-organizing maps
Graepel, T., Burger, M., & Obermayer, K. (1997) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.56.3876 · Cited by 89
Simulated annealing and codebook design
Vaisey, J., & Gersho, A. (2003) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1988.196808 · Cited by 85
Comparison of SOM Point Densities Based on Different Criteria
Kohonen, T. (1999) · Neural Computation · doi:10.1162/089976699300016098 · Cited by 70
Complexity Optimized Data Clustering by Competitive Neural Networks
Buhmann, J. M., & Kühnel, H. (1993) · Neural Computation · doi:10.1162/neco.1993.5.1.75 · Cited by 68
Vector quantization codebook generation using simulated annealing
Flanagan, J. K., Morrell, D. R., Frost, R. L., Read, C. J., & Nelson, B. (2003) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1989.266790 · Cited by 45
Superparamagnetic clustering of data
Wiseman, S., Blatt, M., & Domany, E. (1998) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.57.3767 · Cited by 44
Clustering with competing self-organizing maps
Cheng, Y. (2003) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1992.227222 · Cited by 22
Cited by
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00815-1 · Cited by 2,678
Color image segmentation: advances and prospects
Cheng, H. D., Jiang, X. H., Sun, Y., & Wang, J. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(00)00149-7 · Cited by 1,720
A review of clustering techniques and developments
Saxena, A., Prasad, M., Gupta, A., Bharill, N., Patel, O. P., Tiwari, A., Er, M. J., Ding, W., & Lin, C.-T. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.06.053 · Cited by 1,357
A Novel Chemometric Method for the Prediction of Human Oral Bioavailability
Xu, X., Zhang, W., Huang, C., Li, Y., Yu, H., Wang, Y., Duan, J., & Ling, Y. (2012) · International Journal of Molecular Sciences · doi:10.3390/ijms13066964 · Cited by 845
Metadata
- Authors
- Vesanto, J., & Alhoniemi, E.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2000-05
- Volume
- 11
- Issue
- 3
- Pages
- 586-600
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2110802877
- Cited by
- 2,680
- References
- 33
- FWCI
- 45.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.