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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Wang, L., Jiang, M., Lu, Y., Noe, F., & Smith, J. C. (2006). Self-organizing map clustering analysis for molecular data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 1250–1255). Springer Verlag. https://doi.org/10.1007/11759966_185
Mendeley helps you to discover research relevant for your work.