Cluster Analysis using Growing Neural Gas and Graph Partitioning

The size and complexity of data sets is ever increasing. Clustering, considered the most important unsupervised learning problem, is used to reveal structures and to identify "natural" groupings on the multivariate data. Several competitive learning algorithms were developed for this application. The Growing Neural Gas (GNG) is an incremental algorithm, where no previous information about the number of clusters is preset. New units are added according to the training dynamics. GNG produces a graph that represents the topology of trained data. Each vertex corresponds to a neuron in which input data have been mapped. This paper describes a simple algorithm to better produce the partitioning of this graph, generating connected components that represent different data clusters. The algorithm automatically finds the number of classes and the associated neurons.

[1]  Bernd Fritzke,et al.  Growing cell structures--A self-organizing network for unsupervised and supervised learning , 1994, Neural Networks.

[2]  Neil Davey,et al.  Hierarchical classification with a competitive evolutionary neural tree , 1999, Neural Networks.

[3]  José Alfredo Ferreira Costa,et al.  Clustering of complex shaped data sets via Kohonen maps and mathematical morphology , 2001, Data Mining and Knowledge Discovery: Theory, Tools, and Technology.

[4]  José Alfredo Ferreira Costa.  Classificação automatica e analise de dados por redes neurais auto-organizaveis , 1999 .

[5]  Bernd Fritzke,et al.  A Growing Neural Gas Network Learns Topologies , 1994, NIPS.

[6]  Alfred Ultsch,et al.  Knowledge Extraction from Self-Organizing Neural Networks , 1993 .

[7]  Fionn Murtagh,et al.  Interpreting the Kohonen self-organizing feature map using contiguity-constrained clustering , 1995, Pattern Recognit. Lett..

[8]  Agnes Vathy-Fogarassy,et al.  Topology Representing Networks Based Visualizations of Manifolds , 2008 .

[9]  Jim Holmström,et al.  Examensarbete DV 3 2002-0830 Growing Neural Gas Experiments with GNG , GNG with Utility and Supervised GNG , 2002 .

[10]  Esa Alhoniemi,et al.  Clustering of the self-organizing map , 2000, IEEE Trans. Neural Networks Learn. Syst..

[11]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[12]  Dietmar Heinke,et al.  Comparing neural networks: a benchmark on growing neural gas, growing cell structures, and fuzzy ARTMAP , 1998, IEEE Trans. Neural Networks.

[13]  José Alfredo Ferreira Costa,et al.  Data Clustering using Self-Organizing Maps segmented by Mathematic Morphology and Simplified Cluster Validity Indexes: an application in remotely sensed images , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

[14]  John W. Sammon,et al.  A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.

[15]  Neil Davey,et al.  Hierarchical Growing Neural Gas , 2005 .

[16]  T. Martínez,et al.  Competitive Hebbian Learning Rule Forms Perfectly Topology Preserving Maps , 1993 .

[17]  D. J. Newman,et al.  UCI Repository of Machine Learning Database , 1998 .

[18]  Melody Y. Kiang,et al.  An extended self-organizing map network for market segmentation - a telecommunication example , 2006, Decis. Support Syst..

[19]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[20]  Tommy W. S. Chow,et al.  Clustering of the self-organizing map using a clustering validity index based on inter-cluster and intra-cluster density , 2004, Pattern Recognit..

[21]  José Alfredo Ferreira Costa,et al.  Estimating the Number of Clusters in Multivariate Data by Self-Organizing Maps , 1999, Int. J. Neural Syst..

[22]  Teuvo Kohonen,et al.  Self-Organizing Maps, Third Edition , 2001, Springer Series in Information Sciences.

[23]  Samuel Kaski,et al.  Methods for Exploratory Cluster Analysis , 2003, Intelligent Exploration of the Web.

[24]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .