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

通过拓扑流形学习增强聚类分析

Enhancing cluster analysis via topological manifold learning

Ludwig-Maximilians-Universität München(慕尼黑大学);Christian-Albrechts-Universität zu Kiel(基尔大学)

Moritz Herrmann, Daniyal Kazempour, Fabian Scheipl, Peer Kröger

摘要:

我们讨论了聚类分析的拓扑方面,并表明,在聚类之前推断数据集的拓扑结构可以大大提高聚类检测:理论论据和经验证据表明,聚类嵌入向量,代表数据流形的结构,而不是观察到的特征向量本身,是非常有益的。为了证明,我们结合流形学习方法UMAP推断的拓扑结构与基于密度的聚类方法DBSCAN。合成和真实数据的结果表明,这既简化和提高聚类在不同的低维和高维问题,包括集群的不同密度和/或纠缠的形状。我们的方法简化了聚类,因为拓扑预处理一致地降低了DBSCAN的参数敏感性。使用DBSCAN对生成的嵌入进行聚类,甚至可以胜过SPECTACL和GAN等复杂方法。最后,我们的研究表明,聚类的关键问题似乎不是数据的标称维数或它包含多少不相关的功能,而是如何\textit{separable}的集群是在周围的观察空间中,他们嵌入,这通常是(高维)欧几里得空间定义的数据的功能。我们的方法是成功的,因为我们在将数据投影到一个更合适的空间后执行聚类分析,该空间在某种意义上针对可分性进行了优化。

英文摘要:

We discuss topological aspects of cluster analysis and show that inferring the topological structure of a dataset before clustering it can considerably enhance cluster detection: theoretical arguments and empirical evidence show that clustering embedding vectors, representing the structure of a data manifold instead of the observed feature vectors themselves, is highly beneficial. To demonstrate, we combine manifold learning method UMAP for inferring the topological structure with density-based clustering method DBSCAN. Synthetic and real data results show that this both simplifies and improves clustering in a diverse set of low- and high-dimensional problems including clusters of varying density and/or entangled shapes. Our approach simplifies clustering because topological pre-processing consistently reduces parameter sensitivity of DBSCAN. Clustering the resulting embeddings with DBSCAN can then even outperform complex methods such as SPECTACL and ClusterGAN. Finally, our investigation suggests that the crucial issue in clustering does not appear to be the nominal dimension of the data or how many irrelevant features it contains, but rather how \textit{separable} the clusters are in the ambient observation space they are embedded in, which is usually the (high-dimensional) Euclidean space defined by the features of the data. Our approach is successful because we perform the cluster analysis after projecting the data into a more suitable space that is optimized for separability, in some sense.

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

↑