Proceedings of the 9th annual conference on Genetic and evolutionary computation
Artificial Intelligence in Medicine
A new approach to estimating the expected first hitting time of evolutionary algorithms
Artificial Intelligence
Feature Bispectra and RBF Based FM Signal Recognition
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
Solving the multiple competitive facilities location and design problem on the plane
Evolutionary Computation
Quantum-inspired evolutionary clustering algorithm based on manifold distance
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
An Evolutionary Hierarchical Clustering Method with a Visual Validation Tool
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
A survey of evolutionary algorithms for clustering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Investigation of a new GRASP-based clustering algorithm applied to biological data
Computers and Operations Research
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Step length adaptation by generalized predictive control
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
An evolutionary computational model applied to cluster analysis of DNA microarray data
Expert Systems with Applications: An International Journal
Dynamic clustering using combinatorial particle swarm optimization
Applied Intelligence
Hi-index | 0.00 |
Clustering is concerned with the discovery of interesting groupings of records in a database. Many algorithms have been developed to tackle clustering problems in a variety of application domains. In particular, some of them have been used in bioinformatics research to uncover inherent clusters in gene expression microarray data. In this paper, we show how some popular clustering algorithms have been used for this purpose. Based on experiments using simulated and real data, we also show that the performance of these algorithms can be further improved. For more effective clustering of gene expression microarray data, which is typically characterized by a lot of noise, we propose a novel evolutionary algorithm called evolutionary clustering (EvoCluster). EvoCluster encodes an entire cluster grouping in a chromosome so that each gene in the chromosome encodes one cluster. Based on such encoding scheme, it makes use of a set of reproduction operators to facilitate the exchange of grouping information between chromosomes. The fitness function that the EvoCluster adopts is able to differentiate between how relevant a feature value is in determining a particular cluster grouping. As such, instead of just local pairwise distances, it also takes into consideration how clusters are arranged globally. Unlike many popular clustering algorithms, EvoCluster does not require the number of clusters to be decided in advance. Also, patterns hidden in each cluster can be explicitly revealed and presented for easy interpretation even by casual users. For performance evaluation, we have tested EvoCluster using both simulated and real data. Experimental results show that it can be very effective and robust even in the presence of noise and missing values. Also, when correlating the gene expression microarray data with DNA sequences, we were able to uncover significant biological binding sites (both previously known and unknown) in each cluster discovered by EvoCluster.