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)
MicroCluster: Efficient Deterministic Biclustering of Microarray Data
IEEE Intelligent Systems
An association analysis approach to biclustering
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards efficient mining of proportional fault-tolerant frequent itemsets
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
ABBA: adaptive bicluster-based approach to impute missing values in binary matrices
Proceedings of the 2010 ACM Symposium on Applied Computing
ICDMW '10 Proceedings of the 2010 IEEE International Conference on Data Mining Workshops
Mining a new fault-tolerant pattern type as an alternative to formal concept discovery
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Hi-index | 0.00 |
Biclustering is one of the most popular methods for microarray dataset analysis, which allows for conditions and genes clustering simultaneously. However, due to the influence of experimental noise in the microarray dataset, using traditional biclustering methods may neglect some significative biological biclusters. In order to reduce the influence of noise and find more types of biological biclusters, we propose an algorithm, MFCluster, to mine fault-tolerant biclusters in microarray dataset. MFCluster uses several novel techniques to generate fault-tolerant efficiently by merging nonrelaxed biclusters. MFCluster generates a weighted undirected relational graph firstly. Then all the maximal fault-tolerant biclusters would be mined by using patterngrowth method in above graph. The experimental results show our algorithm is more efficiently than traditional ones.