Name
Abstract | ||
|---|---|---|
A large number of biclustering methods have been proposed to detect patterns in gene expression data. All these methods try to find some type of biclusters but no one can discover all the types of patterns in the data. Furthermore, researchers have to design new algorithms in order to find new types of biclusters/patterns that interest biologists. In this paper, we propose a novel approach for biclustering that, in general, can be used to discover all computable patterns in gene expression data. The method is based on the theory of Kolmogorov complexity. More precisely, we use Kolmogorov complexity to measure the randomness of submatrices as the merit of biclusters because randomness naturally consists in a lack of regularity, which is a common property of all types of patterns. On the basis of algorithmic probability measure, we develop a Markov Chain Monte Carlo algorithm to search for biclusters. Our method can also be easily extended to solve the problems of conventional clustering and checkerboard type biclustering. The preliminary experiments on simulated as well as real data show that our approach is very versatile and promising. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1142/S021972000600217X | J. Bioinformatics and Computational Biology |
Keywords | Field | DocType |
gene expression,kolmogorov complexity.,biclustering | Algorithmic probability,Data mining,Artificial intelligence,Biclustering,Cluster analysis,Randomness,Common property,Kolmogorov complexity,Markov chain monte carlo algorithm,Bioinformatics,Mathematics,Machine learning,Block matrix | Journal |
Volume | Issue | ISSN |
4 | 4 | 0219-7200 |
Citations | PageRank | References |
3 | 0.39 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haifeng Li | 1 | 379 | 18.08 |
| Xin Chen | 2 | 153 | 9.25 |
| Keshu Zhang | 3 | 452 | 29.28 |
| Tao Jiang | 4 | 1809 | 155.32 |