Sharp kernel clustering algorithms and their associated Grothendieck inequalities
From MaRDI portal
Recommendations
- Sharp kernel clustering algorithms and their associated Grothendieck inequalities
- The sharpness of some cluster set results
- A sharp version of Kahan's theorem on clustered eigenvalues
- Concentration of kernel matrices with application to kernel spectral clustering
- The geometry of kernelized spectral clustering
- Minkowski-type theorems and least-squares clustering
- Kernel Approximation on Algebraic Varieties
- Sharp \(L^{p}\) bounds on spectral clusters for Lipschitz metrics
- Sharp Kernels and Canonical Subspaces (Revised)
- Sharp inequalities of singular values of smooth kernels
Cites work
Cited in
(6)- Grothendieck constant is norm of Strassen matrix multiplication tensor
- Low correlation noise stability of symmetric sets
- New perspectives on k-support and cluster norms
- Approximate kernel clustering
- Solution of the propeller conjecture in R^3
- Sharp kernel clustering algorithms and their associated Grothendieck inequalities
This page was built for publication: Sharp kernel clustering algorithms and their associated Grothendieck inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921885)