# Diffusion K-means clustering on manifolds: provable exact recovery via semidefinite relaxations

@article{Chen2019DiffusionKC,
title={Diffusion K-means clustering on manifolds: provable exact recovery via semidefinite relaxations},
author={Xiaohui Chen and Y. Yang},
journal={ArXiv},
year={2019},
volume={abs/1903.04416}
}
• Published 2019
• Mathematics, Computer Science
• ArXiv
We introduce the {\it 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… Expand
Nonlinear dimensionality reduction for clustering
• Computer Science
• Pattern Recognit.
• 2020
Near-Optimal Comparison Based Clustering
• Computer Science, Mathematics
• NeurIPS
• 2020
Cutoff for Exact Recovery of Gaussian Mixture Models
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2021

#### References

SHOWING 1-10 OF 49 REFERENCES
Approximating K-means-type Clustering via Semidefinite Programming
• Mathematics, Computer Science
• SIAM J. Optim.
• 2007
Learning by Unsupervised Nonlinear Diffusion
• Computer Science, Mathematics
• J. Mach. Learn. Res.
• 2019
Sparse Manifold Clustering and Embedding
• Computer Science, Mathematics
• NIPS
• 2011
Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
• E. Arias-Castro
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2011
Fundamental Limitations of Spectral Clustering
• Computer Science, Mathematics
• NIPS
• 2006