# Nearly Optimal Clustering Risk Bounds for Kernel K-Means

9 Mar 2020Yong LiuLizhong DingWeiping Wang

In this paper, we study the statistical properties of kernel $k$-means and obtain a nearly optimal excess clustering risk bound, substantially improving the state-of-art bounds in the existing clustering risk analyses. We further analyze the statistical effect of computational approximations of the Nystr\"{o}m kernel $k$-means, and prove that it achieves the same statistical accuracy as the exact kernel $k$-means considering only $\Omega(\sqrt{nk})$ Nystr\"{o}m landmark points... (read more)

PDF Abstract

# Code Add Remove

No code implementations yet. Submit your code now

# Results from the Paper Add Remove

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

# Methods used in the Paper Add Remove

METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet