Abstract
Clustering is an important technique in microarray data analysis, and mining three-dimensional (3D) clusters in gene-sample-time (simply GST) microarray data is emerging as a hot research topic in this area. A 3D cluster consists of a subset of genes that are coherent on a subset of samples along a segment of time series. This kind of coherent clusters may contain information for the users to identify useful phenotypes, potential genes related to these phenotypes and their expression rules. TRICLUSTER is the state-of-the-art 3D clustering algorithm for GST microarray data. In this paper, we propose a new algorithm to mine 3D clusters over GST microarray data. We term the new algorithm gTRICLUSTER because it is based on a more general 3D cluster model than the one that TRICLUSTER is based on. gTRICLUSTER can find more biologically meaningful coherent gene clusters than TRICLUSTER can do. It also outperforms TRICLUSTER in robustness to noise. Experimental results on a real-world microarray dataset validate the effectiveness of the proposed new algorithm.
The work was supported by the National Natural Science Foundation of China under grant no. 60373019, Open Research Foundation of Shanghai Key Lab of Intelligent Information Processing under grant no. IIPL-04-005, and partially supported by the Shuguang Scholar Program of Shanghai Education Development Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cheng, Y., Church, G.M.: Biclustering gene expression patterns. In: Proc. of the 3rd Annual Int’l Conference on Computational Biology (RECOMB 1999) (1999)
Jiang, D., Pei, J., Ramanathany, M., Tang, C., Zhang, A.: Mining coherent gene clusters from gene-sample-time microarray data. In: Proc. of the 10th ACM SIGKDD Conference (KDD 2004) (2004)
Zhao, L., Zaki, M.J.: TRICLUSTER: An effective algorithm for mining coherent clusters in 3D microarray Data. In: Proc. of SIGMOD 2005 (2005)
Yang, J., et al.: -cluster: Capturing Subspace Correlation in a large Data Set. In: Proc. of ICDE 2002 (2002)
Yeung, K., Ruzzo, W.: An Empirical Study on Principal Component Analysis for Clustering Gene Expression Data. Bioinformatics 17(9), 763–774 (2001)
Balasubramaniyan, R., Hullermeier, E., Weskamp, N., Kamper, J.: Clustering of gene expression data using a local shape-based similary measure. Bioinformatics 21(7) (2005)
Dhillon, I.S., Mallela, S., Modha, D.S.: Information-Theoretical Coclustering. In: Proc. of the Ninth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (KDD 2003), pp. 89–98 (2003)
Liu, J., Yang, J., Wang, W.: Biclustering of gene expression data by tendency. In: Proceedings of the IEEE Computational Systems Bioinformatics Conference (CSB), pp. 182–193 (2004)
Spellmean, P.T., Sherlock, G., Zhang, M.Q., Iyer, V.R., et al.: Comprehensvie identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Molecular Biology of the Cell 9(12), 3273–3297 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, H., Zhou, S., Guan, J., Zheng, Y. (2006). gTRICLUSTER: A More General and Effective 3D Clustering Algorithm for Gene-Sample-Time Microarray Data. In: Li, J., Yang, Q., Tan, AH. (eds) Data Mining for Biomedical Applications. BioDM 2006. Lecture Notes in Computer Science(), vol 3916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11691730_6
Download citation
DOI: https://doi.org/10.1007/11691730_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33104-9
Online ISBN: 978-3-540-33105-6
eBook Packages: Computer ScienceComputer Science (R0)