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
Biclustering Algorithms for Biological Data Analysis: A Survey
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Biclustering of Expression Data with Evolutionary Computation
IEEE Transactions on Knowledge and Data Engineering
Shifting and scaling patterns from gene expression data
Bioinformatics
Evolutionary metaheuristic for biclustering based on linear correlations among genes
Proceedings of the 2010 ACM Symposium on Applied Computing
Iterated local search for biclustering of microarray data
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
Measuring the quality of shifting and scaling patterns in biclusters
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data
Knowledge-Based Systems
Predicting missing values with biclustering: A coherence-based approach
Pattern Recognition
Hi-index | 0.00 |
Many heuristics used for finding biclusters in microarray data use the mean squared residue as a way of evaluating the quality of biclusters. This has led to the discovery of interesting biclusters. Recently it has been proven that the mean squared residue may fail to identify some interesting biclusters. This motivates us to introduce a new measure, called Virtual Error, for assessing the quality of biclusters in microarray data. In order to test the validity of the proposed measure, we include it within an evolutionary algorithm. Experimental results show that the use of this novel measure is effective for finding interesting biclusters, which could not have been discovered with the use of the mean squared residue.