Approaches for measuring the stability of clustering methods

Among the significant factors in assessing the suitability of a clustering technique to a given application is its stability; that is, how sensitive the algorithm is to perturbations in the input data. A number of techniques that appear to be suitable for measuring the stability of clustering have been published in the literature. When these techniques are closely examined, a number of generic approaches emerge. This note reviews these approaches and provides a classification of the various techniques appearing in the literature in terms of the approaches identified.

• Publication year

  1982

• Venue

  SIGF

• Publication date

  1982-07-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1095460.1095461
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Techniques for Measuring the Stability of Clustering: A Comparative Study

  1982cited by this paper
• A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods

  1981cited by this paper
• Extremes in the Complexity of Computing Metric Distances Between Partitions

  1981influential reference
• A Comparison And Evaluation Of Graph Theoretical Clustering Technioues

  1978cited by this paper
• Validity of clusters formed by graph-theoretic cluster methods

  1977cited by this paper
• Graph Theoretic Techniques for Cluster Analysis Algorithms

  1977influential reference
• The stability of two common matching functions in classification with respect to a proposed measure

  1976influential reference
• Dynamic information and library processing

  1975cited by this paper
• Methods of Comparing Classifications

  1974influential reference
• A clustering algorithm based on user queries

  1974cited by this paper
• Multidimensional scaling of measures of distance between partitions

  1973influential reference
• Metrics on spaces of finite trees

  1973influential reference
• A Unified View of Clustering Algorithms

  1971cited by this paper
• A Review of Classification

  1971cited by this paper
• A Successive Approximations Approach to Character Weighting

  1969influential reference
• ON-LINE INFORMATION RETRIEVAL USING ASSOCIATIVE INDEXING

  1968cited by this paper
• Hierarchical clustering schemes

  1967cited by this paper
• A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems

  1967cited by this paper
• A general theory of classificatory sorting strategies: II. Clustering systems

  1967cited by this paper
• Data analysis in the social sciences: what about the details?

  1965cited by this paper
• On Some Clustering Techniques

  1964cited by this paper
• THE COMPARISON OF DENDROGRAMS BY OBJECTIVE METHODS

  1962influential reference
• Numerical Taxonomy

  1962cited by this paper
• A NEW MEASURE OF RANK CORRELATION

  1938cited by this paper
• Biometrika

  1902cited by this paper

• A Survey Report on Clustering of Software Frameworks

  2017cites this paper
• Clustering Methodologies for Software Engineering

  2012cites this paper
• Methods for evaluating, selecting and improving software clustering algorithms

  2010cites this paper
• Multi-level bootstrap analysis of stable clusters in resting-state fMRI

  2009cites this paper
• Persistent Clustering and a Theorem of J. Kleinberg

  2008cites this paper
• XML schema matching : balancing efficiency and effectiveness by means of clustering

  2006cites this paper
• Similarity and stability analysis of the two partitioning type clustering algorithms

  1985cites this paper
• Concepts of the cover coefficient-based clustering methodology

  1985cites this paper