On strong consistency of kernel k-means: a Rademacher complexity approach
From MaRDI portal
Publication:2070586
Recommendations
Cites work
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- 10.1162/153244303321897690
- A Vector-Contraction Inequality for Rademacher Complexities
- Consistency of spectral clustering
- Fast rates for empirical vector quantization
- High-dimensional statistics. A non-asymptotic viewpoint
- Individual Convergence Rates in Empirical Vector Quantizer Design
- Least squares quantization in PCM
- On the Performance of Clustering in Hilbert Spaces
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
- Strong consistency of k-means clustering
- The minimax distortion redundancy in empirical quantizer design
Cited in
(5)- Strong consistency of reduced \(K\)-means clustering
- Concentration of kernel matrices with application to kernel spectral clustering
- Strong consistency of the prototype based clustering in probabilitic space
- On the existence of kernel function for kernel-trick of k-means
- On the existence of kernel function for kernel-trick of \(k\)-means in the light of Gower theorem
This page was built for publication: On strong consistency of kernel \(k\)-means: a Rademacher complexity approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070586)