Clustering by pattern similarity in large data sets
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Biclustering of Expression Data
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Enhanced Biclustering on Expression Data
BIBE '03 Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering
d-Clusters: Capturing Subspace Correlation in a Large Data Set
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A multi-objective approach to discover biclusters in microarray data
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Gene interaction - An evolutionary biclustering approach
Information Fusion
Discovering α-patterns from gene expression data
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
An effective measure for assessing the quality of biclusters
Computers in Biology and Medicine
Hi-index | 0.00 |
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In expression data analysis, the most important goal may not be finding the maximum bicluster, as it might be more interesting to find a set of genes showing similar behavior under a set of conditions. Our approach is based on evolutionary algorithms and searches for biclusters following a sequential covering strategy. In addition, we pay special attention to the fact of looking for high quality biclusters with large variation. The quality of biclusters found by our approach is discussed by means of the analysis of yeast and colon cancer datasets.