Abstract
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 non-relaxed biclusters. MFCluster generates a weighted undirected relational graph firstly. Then all the maximal fault-tolerant biclusters would be mined by using pattern-growth method in above graph. The experimental results show our algorithm is more efficiently than traditional ones.
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 of Expression Data. In: Proc. 8th Int’l Conf. Intelligent Systems for Molecular Biology (ISMB 2000), pp. 93–103. ACM Press, New York (2000)
Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE/ACM TCBB 1(1), 24–45 (2004)
Subramanian, A., Tamayo, P., Mootha, V., Mukherjee, S., Ebert, B., Gillette, M., Paulovich, A., Pomeroy, S., Golub, T., Lander, E.: Gene set enrichment analysis: A knowledge-based approach for interpreting genome-wide expression profiles. PNAS 102(43), 15545–15550 (2005)
Murali, T.M., Kasif, S.: Extracting conserved gene expression motifs from gene expression data. In: Proc. Pac. Symp. Biocomput., pp. 77–88 (2003)
Zhao, L., Zaki, M.: MicroCluster: Efficient deterministic biclustering of Microarray data. IEEE Intelligent Systems 20(6), 40–49 (2005)
Ben-Dor, A., Chor, B., Karp, R., Yakhini, Z.: Discovering local structure in gene expression data: the order-preserving submatrix problem. J. Comput. Biol. 10, 373–384 (2003)
Pandey, G., Atluri, G., Steinbach, M., Myers, C.L., Kumar, V.: An association analysis approach to biclusting. In: Proc. ACM Conf. on Kownlege Discovery and Data Mining, pp. 677–686 (2009)
Besson, J., Robardet, C., Boulicaut, J.F.: Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. In: Schärfe, H., Hitzler, P., Øhrstrøm, P. (eds.) ICCS 2006. LNCS (LNAI), vol. 4068, pp. 144–157. Springer, Heidelberg (2006)
Poernomo, A.K., Gopalkrishnan, V.: Towards efficient mining of proportional fault-tolerant frequent itemsets. In: ACM SIGKDD, pp. 697–706. ACM, New York (2009)
Colantonio, C., Pietro, R.D., Ocello, A., Verde, N.V.: ABBA: Adaptive bicluster-based approach to impute missing values in binary matrices. In: Proceedings of the 25th ACM Symposium on Applied Computing (SAC 2010), pp. 1026–1033 (2010)
Gupta, R., Rao, N., Kumar, V.: Discovery of Error-tolerant Biclusters from Noisy Gene Expression Data. In: Proceedings of BIOKDD 2010, Washington DC, USA (2010)
Wang, M., Shang, X.Q., et al.: FDCluster: Mining Frequent Closed Discriminative Bicluster without Candidate Maintenance in Multiple Microarray Datasets. In: ICDM Workshops 2010, pp. 779–786 (2010)
Zahn, J.M., Poosala, S., et al.: AGEMAP: A gene expression database for aging in mice. PLOS Genetics 3(11), 2326–2337 (2007)
Miao, M., Shang, X.Q., et al.: MRCluster: Mining constant row bicluster in gene expression data. In: Proceedings of the 3rd WASE International Conference Information Engineering (WASE ICIE 2011) (in press, 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, M., Shang, X., Miao, M., Li, Z., Liu, W. (2011). MFCluster: Mining Maximal Fault-Tolerant Constant Row Biclusters in Microarray Dataset. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds) Web-Age Information Management. WAIM 2011. Lecture Notes in Computer Science, vol 6897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23535-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-23535-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23534-4
Online ISBN: 978-3-642-23535-1
eBook Packages: Computer ScienceComputer Science (R0)