Diffusion K-means clustering on manifolds: Provable exact recovery via semidefinite relaxations
Diffusion K-means clustering on manifolds: Provable exact recovery via semidefinite relaxations
复制标题
DOI:
10.1016/j.acha.2020.03.002
复制
发表时间:
2021-02-19
影响因子:
2.5
通讯作者:
Yang, Yun
中科院分区:
文献类型:
--
作者:
Chen, Xiaohui;Yang, Yun
We introduce the diffusion K-means clustering method on Riemannian submanifolds, which maximizes the within-cluster connectedness based on the diffusion distance. The diffusion K-means constructs a random walk on the similarity graph with vertices as data points randomly sampled on the manifolds and edges as similarities given by a kernel that captures the local geometry of manifolds. The diffusion K-means is a multi-scale clustering tool that is suitable for data with non-linear and non-Euclidean geometric features in mixed dimensions. Given the number of clusters, we propose a polynomial-time convex relaxation algorithm via the semidefinite programming (SDP) to solve the diffusion K-means. In addition, we also propose a nuclear norm regularized SDP that is adaptive to the number of clusters. In both cases, we show that exact recovery of the SDPs for diffusion K-means can be achieved under suitable between-cluster separability and within-cluster connectedness of the submanifolds, which together quantify the hardness of the manifold clustering problem. We further propose the localized diffusion K-means by using the local adaptive bandwidth estimated from the nearest neighbors. We show that exact recovery of the localized diffusion K-means is fully adaptive to the local probability density and geometric structures of the underlying submanifolds. (C) 2020 Elsevier Inc. All rights reserved.