Under ideal spherical clusters, the additive penalty coefficient must satisfy N rho^2 / K < lambda < N L^2 / (2K), and a parameter-free multiplicative penalty naturally favors the true cluster count.
Recovering the number of clusters in data sets with noise features using feature rescaling factors
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper we introduce three methods for re-scaling data sets aiming at improving the likelihood of clustering validity indexes to return the true number of spherical Gaussian clusters with additional noise features. Our method obtains feature re-scaling factors taking into account the structure of a given data set and the intuitive idea that different features may have different degrees of relevance at different clusters. We experiment with the Silhouette (using squared Euclidean, Manhattan, and the p$^{th}$ power of the Minkowski distance), Dunn's, Calinski-Harabasz and Hartigan indexes on data sets with spherical Gaussian clusters with and without noise features. We conclude that our methods indeed increase the chances of estimating the true number of clusters in a data set.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Number of Clusters in a Dataset: A Regularized K-means Approach
Under ideal spherical clusters, the additive penalty coefficient must satisfy N rho^2 / K < lambda < N L^2 / (2K), and a parameter-free multiplicative penalty naturally favors the true cluster count.