Cross-Entropy Clustering

Abstract

We construct a cross-entropy clustering (CEC) theory which finds the optimal number of clusters by automatically removing groups which carry no information. Moreover, our theory gives simple and efficient criterion to verify cluster validity. Although CEC can be build on an arbitrary family of densities, in the most important case of Gaussian CEC: {\em -- the division into clusters is affine invariant; -- the clustering will have the tendency to divide the data into ellipsoid-type shapes; -- the approach is computationally efficient as we can apply Hartigan approach.} We study also with particular attention clustering based on the Spherical Gaussian densities and that of Gaussian densities with covariance $s \I$. In the letter case we show that with $s$ converging to zero we obtain the classical k-means clustering.

References in corpus (2)

• Revisiting k-means: New Algorithms via Bayesian Nonparametrics
• Detection of elliptical shapes via cross-entropy clustering

Cited by in corpus (5)

• Representative community divisions of networks
• Semi-supervised cross-entropy clustering with information bottleneck constraint
• Compressing network populations with modal networks reveals structural diversity
• Active Function Cross-Entropy Clustering
• A local Gaussian filter and adaptive morphology as tools for completing partially discontinuous curves