arXiv Machine Learning
Sector-Mean: Deterministic Initialization of K-Means Centroids via Angular Sector Partitioning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
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 Machine Learning
Aug 5
Strong bounds for large-scale Minimum Sum-of-Squares Clustering
arXiv:2502. 08397v3 Announce Type: replace-cross Abstract: Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together.
arXiv Machine Learning
Jul 20
Data-Native Global Optimization for Big Data K-means Clustering
arXiv:2607. 15835v1 Announce Type: new Abstract: Big data clustering remains challenging: the Minimum Sum-of-Squares Clustering (MSSC) problem underlying K-means is NP-hard, and existing methods either reach poor local minima or require prohibitive metaheuristic hybrids.
arXiv Machine Learning
Jul 1
MNAR-$k$-means: A $k$-means Clustering for Data Missing Not at Random with Magnitude-Decaying Probability
arXiv:2606. 31253v1 Announce Type: cross Abstract: The classical $k$-means clustering, based on distances computed from all data features, cannot be directly applied to incomplete data with missing values.
arXiv Statistics ML
Sep 1
Robust K-means Clustering using the Density Power Divergence Measure
arXiv:2608.30093v1 Announce Type: cross Abstract: We introduce a robust clustering method, MK-means DPD, that estimates cluster centers and covariance matrices using density power divergence (DPD) me...
arXiv Machine Learning
Jul 30
Randomizing the Number of Centers in k-means++
arXiv:2607. 26202v1 Announce Type: cross Abstract: The $k$-means++ algorithm is a standard and widely used seeding method for $k$-means clustering, but for a fixed number $k$ of centers its worst-case expected approximation ratio is $\Theta(\log k)$.