Abstract
Biclustering is a data mining technique which allows simultaneous clustering of the rows and columns of a matrix. In this paper, MAXimal BICluster algorithm (MAXBIC) identifies coherent biclusters of maximum size with high Average Spearman Rho (ASR). This proposed query based algorithm includes three steps viz. three tier pre-processing, identifying a bicluster seed and growing the seed till an optimal bicluster is obtained. Experimental results show the effectiveness of the proposed algorithm.
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
Bagyamani, J., Thangavel, K.: SIMBIC: similarity based biclustering of expression data. Information Processing and management 70, 437–441 (2010)
Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proceedings of 8th International Conference on Intelligent Systems for Molecular Biology, ISMB-2000 Proceedings, pp. 93–103 (2000)
Hartigan, J.A.: Direct clustering of a data matrix. Journal of the American Statistical Association (JASA) 67(337), 123–129 (1972)
Liu, X., Liu, L.W.X.: Computing maximum similarity biclusters of gene expression data. Bioinformatics 23(1), 50–56 (2007)
Ayadi, W., Elloumi, M., Hao, J.-K.: A biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data. Biodata Mining
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagyamani, J., Thangavel, K., Rathipriya, R. (2010). Extraction of Optimal Biclusters from Gene Expression Data. In: Das, V.V., Vijaykumar, R. (eds) Information and Communication Technologies. ICT 2010. Communications in Computer and Information Science, vol 101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15766-0_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-15766-0_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15765-3
Online ISBN: 978-3-642-15766-0
eBook Packages: Computer ScienceComputer Science (R0)