An approach to cluster separability in a partition

In this paper, we consider the problem of cluster separability in a minimum distance partition based on the squared Euclidean distance. We give a characterization of a well-separated partition and provide an operational criterion that gives the possibility to measure the quality of cluster separability in a partition. Especially, the analysis of cluster separability in a partition is illustrated by implementation of the k-means algorithm.