K-Splits: Improved K-Means Clustering Algorithm to Automatically Detect the Number of Clusters. (arXiv:2110.04660v2 [cs.CV] UPDATED)

This paper introduces k-splits, an improved hierarchical algorithm based on
k-means to cluster data without prior knowledge of the number of clusters.
K-splits starts from a small number of clusters and uses the most significant
data distribution axis to split these clusters incrementally into better fits
if needed. Accuracy and speed are two main advantages of the proposed method.
We experiment on six synthetic benchmark datasets plus two real-world datasets
MNIST and Fashion-MNIST, to prove that our algorithm has excellent …

algorithm arxiv clustering clustering algorithm cv k-means