Self-Organizing Map Clustering Analysis for Molecular Data

In this paper hierarchical clustering and self-organizing maps (SOM) clustering are compared by using molecular data of large size sets. The hierarchical clustering can represent a multi-level hierarchy which show the tree relation of cluster distance. SOM can adapt the winner node and its neighborhood nodes, it can learn topology and represent roughly equal distributive regions of the input space, and similar inputs are mapped to neighboring neurons. By calculating distances between neighboring units and Davies-Boulding clustering index, the cluster boundaries of SOM are decided by the best Davies-Boulding clustering index. The experimental results show the effectiveness of clustering for molecular data, between-cluster distance of low energy samples from transition networks is far bigger than that of "local sampling" samples, the former has a better cluster result, "local sampling" data nevertheless exhibit some clusters.

[1]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Teuvo Kohonen,et al.  The self-organizing map , 1990, Neurocomputing.

[3]  Bo Zhang,et al.  Self-organizing Map Analysis Consistent with Neuroimaging for Chinese Noun, Verb and Class-Ambiguous Word , 2005, ISNN.