Adaptive Manifold Clustering

TL;DR

This paper advances understanding of the Adaptive Weights Clustering method, combining adaptive clustering and manifold learning to effectively analyze high-dimensional data with complex, unbalanced clusters, supported by theoretical insights and experiments.

Contribution

It provides a theoretical analysis of AWC's efficiency in high dimensions, leveraging manifold assumptions to improve clustering performance and parameter tuning.

Findings

AWC performs well on high-dimensional data with complex cluster shapes.

Theoretical bounds depend on the intrinsic manifold dimension.

Numerical experiments validate the approach's effectiveness.

Abstract

Clustering methods seek to partition data such that elements are more similar to elements in the same cluster than to elements in different clusters. The main challenge in this task is the lack of a unified definition of a cluster, especially for high dimensional data. Different methods and approaches have been proposed to address this problem. This paper continues the study originated by Efimov, Adamyan and Spokoiny (2019) where a novel approach to adaptive nonparametric clustering called Adaptive Weights Clustering (AWC) was offered. The method allows analyzing high-dimensional data with an unknown number of unbalanced clusters of arbitrary shape under very weak modeling assumptions. The procedure demonstrates a state-of-the-art performance and is very efficient even for large data dimension D. However, the theoretical study in Efimov, Adamyan and Spokoiny (2019) is very limited and did not really address the question of efficiency. This paper makes a significant step in understanding the remarkable performance of the AWC procedure, particularly in high dimension. The approach is based on combining the ideas of adaptive clustering and manifold learning. The manifold hypothesis means that high dimensional data can be well approximated by a d-dimensional manifold for small d helping to overcome the curse of dimensionality problem and to get sharp bounds on the cluster separation which only depend on the intrinsic dimension d. We also address the problem of parameter tuning. Our general theoretical results are illustrated by some numerical experiments.