arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.16552cs.LG
收藏

DECWA:基于Wasserstein距离的密度聚类

DECWA : Density-Based Clustering using Wasserstein Distance

IRIT(图卢兹计算机科学研究所)

Nabil El Malki, Robin Cugny, Olivier Teste, Franck Ravat

AI总结:

提出基于空间密度和概率方法的DECWA聚类算法,利用Wasserstein度量测量子簇概率密度函数间距离并聚集相似子簇,有效解决了低密度和相似密度簇的识别问题。

摘要:

聚类是一种通过发现称为簇的数据组来提取知识的数据分析方法。在这些方法中,最先进的基于密度的聚类方法已被证明对任意形状的簇是有效的。尽管结果令人鼓舞,但它们在寻找低密度簇、相似密度附近的簇以及高维数据时存在困难。我们的提议是一种新的簇表征方法和一种基于空间密度和概率方法的新聚类算法。首先,使用表示为点对之间距离的概率密度函数($p.d.f$)的空间密度来构建子簇。然后提出一种方法,利用子簇的密度($p.d.f$)和空间距离来聚集相似的子簇。我们提出的关键思想是使用Wasserstein度量,这是一种测量子簇$p.d.f$之间距离的强大工具。我们表明,我们的方法在多种数据集上优于其他最先进的基于密度的聚类方法。

英文摘要:

Clustering is a data analysis method for extracting knowledge by discovering groups of data called clusters. Among these methods, state-of-the-art density-based clustering methods have proven to be effective for arbitrary-shaped clusters. Despite their encouraging results, they suffer to find low-density clusters, near clusters with similar densities, and high-dimensional data. Our proposals are a new characterization of clusters and a new clustering algorithm based on spatial density and probabilistic approach. First of all, sub-clusters are built using spatial density represented as probability density function ($p.d.f$) of pairwise distances between points. A method is then proposed to agglomerate similar sub-clusters by using both their density ($p.d.f$) and their spatial distance. The key idea we propose is to use the Wasserstein metric, a powerful tool to measure the distance between $p.d.f$ of sub-clusters. We show that our approach outperforms other state-of-the-art density-based clustering methods on a wide variety of datasets.

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

↑