Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Xing, E. P.
Right arrow Articles by Karp, R. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Xing, E. P.
Right arrow Articles by Karp, R. M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 90001 2001
Pages S306-S315
© 2001 Oxford University Press

CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts

Eric P. Xing and Richard M. Karp

Division of Computer Science, University of California, Berkeley, Berkeley, CA 94720, USA

Received on February 5, 2001 ; revised on April 1, 2001 ; accepted on April 1, 2001

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.

Contact: epxing{at}cs.berkeley.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BiostatisticsHome page
G. Nowak and R. Tibshirani
Complementary hierarchical clustering
Biostat., July 1, 2008; 9(3): 467 - 483.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
N. Wicker, D. Dembele, W. Raffelsberger, and O. Poch
Density of points clustering, application to transcriptomic data analysis
Nucleic Acids Res., September 15, 2002; 30(18): 3992 - 4000.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.