DocumentCode :
755900
Title :
MicroCluster: efficient deterministic biclustering of microarray data
Author :
Zhao, Lizhuang ; Zaki, Mohammed J.
Author_Institution :
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
Volume :
20
Issue :
6
fYear :
2005
Firstpage :
40
Lastpage :
49
Abstract :
MicroCluster can mine different types of arbitrarily positioned and overlapping clusters of genetic data to find interesting patterns. Our approach has four key features. First, we mine only the maximal biclusters satisfying certain homogeneity criteria. Second, the clusters can be arbitrarily positioned anywhere in the input data matrix, and they can have arbitrary overlapping regions. Third, MicroCluster uses a flexible definition of a cluster that lets it mine several types of biclusters (which previously were studied independently). Finally, MicroCluster can delete or merge biclusters that have large overlaps. So, it can tolerate some noise in the data set and let users focus on the most important clusters. We´ve developed a set of metrics to evaluate the clustering quality and have tested MicroCluster´s effectiveness on several synthetic and real data sets.
Keywords :
biology computing; data mining; genetics; pattern clustering; MicroCluster; deterministic biclustering; genetic data mining; microarray data; Circuit noise; Clustering algorithms; Clustering methods; Data mining; Gene expression; Genetics; Heuristic algorithms; Testing; bicluster; bioinformatics; clustering; data mining; gene expression; microarrays;
fLanguage :
English
Journal_Title :
Intelligent Systems, IEEE
Publisher :
ieee
ISSN :
1541-1672
Type :
jour
DOI :
10.1109/MIS.2005.112
Filename :
1556514
Link To Document :
بازگشت