Stability-Based Model Order Selection in Clustering with Applications to Gene Expression Data

Authors:
Volker Roth;Mikio L. Braun;Tilman Lange;Joachim M. Buhmann
Affiliations:
-;-;-;-
Venue:
ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
Year:
2002

Citing 2
Cited 3

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Resampling Method for Unsupervised Estimation of Cluster Validity

Neural Computation

Model-based evaluation of clustering validation measures

Pattern Recognition
An effective evaluation measure for clustering on evolving data streams

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
OClustR: A new graph-based algorithm for overlapping clustering

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of cluster stability is introduced to assess the validity of data partitionings found by clustering algorithms. It allows us to explicitly quantify the quality of a clustering solution, without being dependent on external information. The principle of maximizing the cluster stability can be interpreted as choosing the most self-consistent data partitioning. We present an empirical estimator for the theoretically derived stability index, based on resampling. Experiments are conducted on well known gene expression data sets, reanalyzing the work by Alon et al. [1] and by Spellman et al. [8].