CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts.
We present CLIFF, an algorithm for clustering biological samples using gene expression microarray data. This clustering problem is difficult for several reasons, in particular the sparsity of the data, the high dimensionality of the feature (gene) space, and the fact that many features are irrelevant or redundant. Our algorithm iterates between two computational processes, feature filtering and clustering. Given a reference partition that approximates the correct clustering of the samples, our feature filtering procedure ranks the features according to their intrinsic discriminability, relevance to the reference partition, and irredundancy to other relevant features, and uses this ranking to select the features to be used in the following round of clustering. Our clustering algorithm, which is based on the concept of a normalized cut, clusters the samples into a new reference partition on the basis of the selected features. On a well-studied problem involving 72 leukemia samples and 7130 genes, we demonstrate that CLIFF outperforms standard clustering approaches that do not consider the feature selection issue, and produces a result that is very close to the original expert labeling of the sample set.
Xing
E P
EP
Division of Computer Science, University of California, Berkeley, Berkeley, CA 94720, USA. epxing@cs.berkeley.edu
Karp
R M
RM
D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology; D020869:Gene Expression Profiling / Q000706:statistics & numerical data*; D006801:Humans; D007938:Leukemia / Q000235:genetics; D008390:Markov Chains; D020411:Oligonucleotide Array Sequence Analysis / Q000706:statistics & numerical data*