Abstract
Determining the number of clusters has been one of the most difficult problems in data clustering. The Self-Organizing Map (SOM) has been widely used for data visualization and clustering. The SOM can reduce the complexity in terms of computation and noise of input patterns. However, post processing steps are needed to extract the real data structure learnt by the map. One approach is to use other algorithm, such as K-means, to cluster neurons. Finding the best value of K can be aided by using an cluster validity index. On the other hand, graph–based clustering has been used for cluster analysis. This paper addresses an alternative methodology using graph theory for SOM clustering. The Davies–Bouldin index is used as a cluster validity to analyze inconsistent neighboring relations between neurons. The result is a segmented map, which indicates the number of clusters as well as the labeled neurons. This approach is compared with the traditional approach using K-means. The experimental results using the approach addressed here with three different databases presented consistent results of the expected number of clusters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jain, A.L.: Data clustering: 50 years beyond K-Means. Pattern Recognition Letter 31(8), 651–666 (2010)
Wu, Z., Leahy, R.: An optimal graph thoretic approach to data clustering: theory ans its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(11) (November 1993)
Duda, R., Hart, P., Stork, D.: Pattern Classification and Scene Analysis. John Wiley Professio. Wiley (2000)
Sassi, R., Silva, L.A., Del-Moral-Hernandez, E.: A Methodology Using Neural Network to Cluster Validity Discovered from a Marketing Database. In: Brazilian Symposium on Neural Networks, SBRN 2008, vol. 08, pp. 3–8 (2008)
Lew, M.S., Sebe, N., Djeraba, C., Jain, R.: Content-Based Multimedia Information Retrieval: State of the Art and Challenges. ACM Transactions on Multimedia Computing, Communications and Applications 2(1), 1–19 (2006)
Vesanto, J., Alhoniemi, E.: Clustering of the self-organizing map. IEEE Transaction on Neural Network 11, 586–600 (2000)
Kohonen, T.: Self-Organizing Maps. Third extended edn. Springer, Heidelberg (2001)
Costa, J.A.F., Netto, M.L.A.: Segmentação do SOM baseada en particionamento de grafos. In: Proceedings of the VI Brazilian Conference on Neural Networks - CBRN, pp. 451–456 (2003)
Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans Patt. Anal. Machine Intell., PAMI-1, 224–227 (1979)
Halkidi, M., Batistakis, Y., Michalis, V.: On Clustering Validation Techniques. Journal of Intelligent Information Systems 17(2), 107–145 (2002)
SOMToolbox. SOM toolbox, a function package for matlab 5 implementing the self-organizing maps, SOM (2011), http://www.cis.hut.fi/projects/somtoolbox/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silva, L.A., Costa, J.A.F. (2011). A Graph Partitioning Approach to SOM Clustering. In: Yin, H., Wang, W., Rayward-Smith, V. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2011. IDEAL 2011. Lecture Notes in Computer Science, vol 6936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23878-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-23878-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23877-2
Online ISBN: 978-3-642-23878-9
eBook Packages: Computer ScienceComputer Science (R0)