arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2309.03751cs.LGstat.ML
收藏

Medoid Silhouette聚类与自动簇数选择

Medoid Silhouette clustering with automatic cluster number selection

TU Dortmund University(多特蒙德工业大学)

Lars Lenssen, Erich Schubert

AI总结:

本文提出基于质心的轮廓系数高效变体,结合PAM与FasterPAM实现快速优化,并支持自动选择最优簇数,实验显示显著加速。

摘要:

聚类结果的评估是困难的,高度依赖于被评估的数据集和评估者的视角。存在许多不同的聚类质量度量,试图提供一种通用的度量来验证聚类结果。一个非常流行的度量是轮廓系数(Silhouette)。我们讨论了基于质心(medoid)的高效轮廓系数变体,对其性质进行了理论分析,提供了两种用于直接优化的快速版本,并讨论了如何利用它来选择最优的簇数。我们将原始轮廓系数的思想与著名的PAM算法及其最新改进FasterPAM相结合。其中一个版本保证与原始变体产生相同的结果,并提供$O(k^2)$的运行加速。在包含30000个样本和$k$=100的真实数据实验中,我们观察到与原始PAMMEDSIL算法相比,实现了10464倍的加速。此外,我们提供了一个直接选择最优簇数的变体。

英文摘要:

The evaluation of clustering results is difficult, highly dependent on the evaluated data set and the perspective of the beholder. There are many different clustering quality measures, which try to provide a general measure to validate clustering results. A very popular measure is the Silhouette. We discuss the efficient medoid-based variant of the Silhouette, perform a theoretical analysis of its properties, provide two fast versions for the direct optimization, and discuss the use to choose the optimal number of clusters. We combine ideas from the original Silhouette with the well-known PAM algorithm and its latest improvements FasterPAM. One of the versions guarantees equal results to the original variant and provides a run speedup of $O(k^2)$. In experiments on real data with 30000 samples and $k$=100, we observed a 10464$\times$ speedup compared to the original PAMMEDSIL algorithm. Additionally, we provide a variant to choose the optimal number of clusters directly.

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

↑