Mean Squared Residue Based Biclustering Algorithms
The availability of large microarray data has brought along many challenges for biological data mining. Following Cheng and Church , many different biclustering methods have been widely used to find appropriate subsets of experimental conditions. Still no paper directly optimizes or bounds the Mean Squared Residue (MSR) originally suggested by Cheng and Church. Their algorithm, for a given expression matrix A and an upper bound on MSR, finds k almost non overlapping biclusters whose sizes are not predefined thus making it difficult to compare with other methods.
In this paper, we propose two new Mean Squared Residue (MSR) based biclustering methods. The first method is a dual biclustering algorithm which finds (k ×l)-bicluster with MSR using a greedy approach. The second method combines dual biclustering algorithm with quadratic programming. The dual biclustering algorithm reduces the size of the matrix, so that the quadratic program can find an optimal bicluster reasonably fast. We control bicluster overlapping by changing the penalty for reusing cells in biclusters. The average MSR in biclusterings for yeast is almost the same as for the proposed dual biclustering while the median MSR is 1.5 times larger thus implying that the quadratic program finds much better smaller biclusters.
KeywordsQuadratic Program Expression Matrix Greedy Approach Quadratic Program Algorithm Biclustering Algorithm
Unable to display preview. Download preview PDF.
- 2.Baldi, P., Hatfield, G.W.: DNA Microarrays and Gene Expression. From Experiments to Data Analysis and Modelling. Cambridge Univ. Press, Cambridge (2002)Google Scholar
- 3.Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization, Athena Scientific (1997)Google Scholar
- 4.Cheng, Y., Church, G.M.: Biclustering of Expression Data. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, pp. 93–103. AAAI Press, Menlo Park (2000)Google Scholar
- 8.Ravikumar, P., Lafferty, J.: Quadratic programming relaxations for metric labeling and Markov random field MAP estimation. In: Proceedings of the 23rd international conference on Machine learning, pp. 737–744 (2006)Google Scholar
- 9.Shamir, R.: Lecture notes, http://www.cs.tau.ac.il/~rshamir/ge/05/scribes/lec04.pdf
- 10.Tanay, A., Sharan, R., Shamir, R.: Discovering Statistically Significant Biclusters in Gene Expression Data. Bioinformatics 18, 136–144 (2002)Google Scholar
- 12.Yang, J., Wang, H., Wang, W., Yu, P.: Enhanced biclustering on gene expression data. In: Proceedings of the 3rd IEEE Conference on Bioinformatics and Bioengineering (BIBE), pp. 321–327 (2003)Google Scholar
- 13.Zhang, Y., Zha, H., Chu, C.H.: A time-series biclustering algorithm for revealing co-regulated genes. In: Proc. Int. Symp. Infoation and Technology: Coding and Computing (ITCC 2005), Las Vegas, USA, pp. 32–37 (2005)Google Scholar
- 14.Zhou, J., Khokhar, A.A.: ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets. In: Proc. of the 26th IEEE International Conference on Distributed Computing Systems, ICDCS (2006)Google Scholar