arXiv Statistics ML
Robust K-means Clustering using the Density Power Divergence Measure
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Jul 31
A novel k-means clustering approach using two distance measures for Gaussian data
arXiv:2511. 17823v2 Announce Type: replace Abstract: Clustering algorithms have long been the topic of research, representing the more popular side of unsupervised learning.
arXiv Statistics ML
Aug 31
Robust model-based clustering via mixtures of multivariate pseudo-Voigt distributions
The paper introduces a multivariate pseudo‑Voigt mixture model, combining Gaussian and Cauchy components with shared location and scale parameters, for robust clustering and outlier detection. Parameter estimation is performed using an EM algorithm that leverages latent variables for efficient likelihood inference. The authors evaluate the model through simulations and real data, comparing it to established robust mixtures such as contaminated normals, and demonstrate its effectiveness on heavy‑tailed datasets.
arXiv Machine Learning
Jul 28
The K-SCAN Clustering Algorithm
arXiv:2607. 24537v1 Announce Type: new Abstract: In the Big Data era, the scalability of clustering algorithms constitutes a key challenge.
arXiv Machine Learning
Jun 2
Cellwise and Casewise Robust Covariance in High Dimensions
arXiv:2505. 19925v2 Announce Type: replace-cross Abstract: The sample covariance matrix is a cornerstone of multivariate statistics, but it is highly sensitive to outliers.
arXiv Machine Learning
Aug 28
Absolute indices for determining compactness, separability and number of clusters
The paper introduces absolute cluster indices that assess both compactness and separability of clusters, moving beyond relative measures commonly used in clustering validation. It defines a compactness function for each cluster and a set of neighboring points for cluster pairs to evaluate cluster quality and overall distribution margin. These indices are applied to determine the true number of clusters and are compared against widely-used validity indices on synthetic and real-world datasets.
arXiv Machine Learning
Sep 10
Sector-Mean: Deterministic Initialization of K-Means Centroids via Angular Sector Partitioning
arXiv:2609.06468v1 Announce Type: new Abstract: K-Means is one of the most widely used clustering algorithms, but its susceptibility to initial centroid selection remains a primary bottleneck for its...