Skip to content

A Cluster Separation Measure

David L. Davies, Donald W. Bouldin

IEEE Transactions on Pattern Analysis and Machine Intelligence · 1979 · 9,641 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Davies, D. L., & Bouldin, D. W. (1979). A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-1(2), 224–227. https://doi.org/10.1109/tpami.1979.4766909

In text: (Davies & Bouldin, 1979)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

A measure is presented which indicates the similarity of clusters which are assumed to have a data density which is a decreasing function of distance from a vector characteristic of the cluster. The measure can be used to infer the appropriateness of data partitions and can therefore be used to compare relative appropriateness of various divisions of the data. The measure does not depend on either the number of clusters analyzed nor the method of partitioning of the data and can be used to guide a cluster seeking algorithm.

  1. Regression Shrinkage and Selection Via the Lasso1996
  2. Maximum Likelihood from Incomplete Data Via the EM Algorithm1977
  3. Latent dirichlet allocation2003
  4. A tutorial on hidden Markov models and selected applications in speech recognition1989
  5. Statistical Analysis With Missing Data1989

Metadata from OpenAlex (CC0). Citations are generated from the published record.