arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.04660cs.CVcs.AIcs.ITmath.IT
收藏

K-Splits:改进的K-Means聚类算法自动检测聚类数

K-Splits: Improved K-Means Clustering Algorithm to Automatically Detect the Number of Clusters

University of Tehran(德黑兰大学)

Seyed Omid Mohammadi, Ahmad Kalhor, Hossein Bodaghi

摘要:

本文介绍了k-splits,一种改进的分层算法的基础上,k-means聚类数据没有先验知识的聚类数。K分割从少量的聚类开始,并使用最重要的数据分布轴将这些聚类逐步分割为更好的拟合(如果需要)。准确性和速度是所提出的方法的两个主要优点。我们在六个合成基准数据集和两个真实世界的数据集MNIST和Fashion-MNIST上进行了实验,证明我们的算法在不同条件下找到正确的聚类数时具有很好的准确性。我们还表明,k-分裂比类似的方法更快,甚至可以比标准的k-均值更快,在较低的维度。最后,我们建议使用k-分裂来揭示质心的确切位置,然后将它们作为初始点输入到k-均值算法以微调结果。

英文摘要:

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 accuracy in finding the correct number of clusters under different conditions. We also show that k-splits is faster than similar methods and can even be faster than the standard k-means in lower dimensions. Finally, we suggest using k-splits to uncover the exact position of centroids and then input them as initial points to the k-means algorithm to fine-tune the results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑