Algorithms for clustering data
Algorithms for clustering data
Gene Expression Data Mining for Functional Genomics using Fuzzy Technology
Advances in Computational Intelligence and Learning: Methods and Applications
Analysis and visualization of gene expression data using self-organizing maps
Neural Networks - New developments in self-organizing maps
A new model of self-organizing neural networks and its application in data projection
IEEE Transactions on Neural Networks
Robust growing neural gas algorithm with application in cluster analysis
Neural Networks - 2004 Special issue: New developments in self-organizing systems
Dynamic Growing Self-organizing Neural Network for Clustering
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
A discrete particle swarm optimization algorithm with fully communicated information
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Exploiting data topology in visualization and clustering of self-organizing maps
IEEE Transactions on Neural Networks
Approximation algorithms for bi-clustering problems
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Hi-index | 0.00 |
This paper introduces a new model of self-organizing map (SOM) known as adaptive double self-organizing map (ADSOM). ADSOM has a flexible topology and performs data partitioning and cluster visualization simultaneously without requiring a priori knowledge about the number of clusters. It combines features of the popular SOM with two-dimensional position vectors, which serve as a visualization tool to detect the number of clusters present in the data. ADSOM updates its free parameters and allows convergence of its position vectors to a fairly consistent number of clusters provided its initial number of nodes is greater than the expected number of clusters. A novel index is introduced based on hierarchical clustering of the final locations of position vectors. The index allows automated detection of the number of clusters, thereby reducing human error that could be incurred from counting clusters visually. To test ADSOM's consistency in data partitioning, we examine the number of common profiles found in the clusters that were obtained by varying the initial number of nodes. This provides a confidence measure for the clusters formed by ADSOM and illustrates the effect of different initial number of nodes on data partitioning. The reliance of ADSOM in identifying number of clusters is demonstrated by applying it to publicly available yeast gene expression data.