Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
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 Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Lange, T.
Right arrow Articles by Buhmann, J. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Lange, T.
Right arrow Articles by Buhmann, J. M.
(Neural Computation. 2004;16:1299-1323.)
© 2004 The MIT Press


Letter

Stability-Based Validation of Clustering Solutions

Tilman Lange

tilman.lange{at}info.ethz.ch, Swiss Federal Institute of Technology (ETH) Zurich, Institute for Computational Science, CH-8092 Zurich, Switzerland

Volker Roth

volker.roth{at}info.ethz.ch, Swiss Federal Institute of Technology (ETH) Zurich, Institute for Computational Science, CH-8092 Zurich, Switzerland

Mikio L. Braun

braunm{at}cs.uni-bonn.de, Rheinische Friedrich-Wilhelms-Universität Bonn, Institut für Informatik III, 53117 Bonn, Germany

Joachim M. Buhmann

jbuhmann{at}info.ethz.ch, Swiss Federal Institute of Technology (ETH) Zurich, Institute for Computational Science, CH-8092 Zurich, Switzerland

Data clustering describes a set of frequently employed techniques in exploratory data analysis to extract "natural" group structure in data. Such groupings need to be validated to separate the signal in the data from spurious structure. In this context, finding an appropriate number of clusters is a particularly important model selection question. We introduce a measure of cluster stability to assess the validity of a cluster model. This stability measure quantifies the reproducibility of clustering solutions on a second sample, and it can be interpreted as a classification risk with regard to class labels produced by a clustering algorithm. The preferred number of clusters is determined by minimizing this classification risk as a function of the number of clusters. Convincing results are achieved on simulated as well as gene expression data sets. Comparisons to other methods demonstrate the competitive performance of our method and its suitability as a general validation tool for clustering solutions in real-world problems.




This article has been cited by other articles:


Home page
BioinformaticsHome page
J. Handl, J. Knowles, and D. B. Kell
Computational cluster validation in post-genomic data analysis
Bioinformatics, August 1, 2005; 21(15): 3201 - 3212.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
S. Still and W. Bialek
How Many Clusters? An Information-Theoretic Perspective
Neural Comput., December 1, 2004; 16(12): 2483 - 2506.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2004 by The MIT Press.