login

A Cluster Separation Measure

IEEE Transactions on Pattern Analysis and Machine IntelligencePublished 1 April 1979
David L. Davies, Donald W. Bouldin
Citations8,543
SJR quartileQ1
SJR score3.91
SNIP5.99

TL;DR

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 which can be used to infer the appropriateness of data partitions.

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.

Keywords

Computer Science