loading...
MicroCluster: Efficient Deterministic Biclustering of Microarray Data
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MIS.2005.112November/December 2005 (vol. 20 no. 6) pp. 40-49
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lizhuang Zhao, Rensselaer Polytechnic Institute
Mohammed J. Zaki, Rensselaer Polytechnic Institute
MicroCluster is a deterministic biclustering algorithm that can mine arbitrarily positioned and overlapping clusters of gene expression data to find interesting patterns. Depending on the parameter values, MicroCluster can mine different types of clusters, including those with constant or similar row or column values, as well as scaling and shifting expression patterns. MicroCluster first constructs a range multigraph, a compact representation of all value ranges in the data set that are similar between any two columns. It then searches for constrained maximal cliques in this multigraph to yield the final set of biclusters. Optionally, MicroCluster merges or deletes clusters with large overlaps. Tests on several synthetic and real data sets illustrate MicroCluster's effectiveness.

This article is part of a special issue on data mining for bioinformatics.

Index Terms:
bioinformatics, bicluster, clustering, microarrays, gene expression, data mining
Citation:
Lizhuang Zhao, Mohammed J. Zaki, "MicroCluster: Efficient Deterministic Biclustering of Microarray Data," IEEE Intelligent Systems, vol. 20, no. 6, pp. 40-49, Nov./Dec. 2005, doi:10.1109/MIS.2005.112
Usage of this product signifies your acceptance of the Terms of Use.