Issue No. 02 - March/April (2001 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.917561
<p><b>Abstract</b>—We propose a hierarchical clustering algorithm (TreeGCS) based upon the Growing Cell Structure (GCS) neural network of Fritzke. Our algorithm refines and builds upon the GCS base, overcoming an inconsistency in the original GCS algorithm, where the network topology is susceptible to the ordering of the input vectors. Our algorithm is unsupervised, flexible, and dynamic and we have imposed no additional parameters on the underlying GCS algorithm. Our ultimate aim is a hierarchical clustering neural network that is both consistent and stable and identifies the innate hierarchical structure present in vector-based data. We demonstrate improved stability of the GCS foundation and evaluate our algorithm against the hierarchy generated by an ascendant hierarchical clustering dendogram. Our approach emulates the hierarchical clustering of the dendogram. It demonstrates the importance of the parameter settings for GCS and how they affect the stability of the clustering.</p>
Unsupervised, growing, neural, network, hierarchical, cluster, topology.
V. J. Hodge and J. Austin, "Hierarchical Growing Cell Structures: TreeGCS," in IEEE Transactions on Knowledge & Data Engineering, vol. 13, no. , pp. 207-218, 2001.