On strong consistency of kernel k-means: a Rademacher complexity approach

DOI10.1016/J.SPL.2021.109291zbMATH Open1478.62158OpenAlexW3209071142MaRDI QIDQ2070586FDOQ2070586

Authors: Anish Chakrabarty, Swagatam Das 

Publication date: 24 January 2022

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2021.109291

Recommendations

• Strong consistency of reduced \(K\)-means clustering
• Concentration of kernel matrices with application to kernel spectral clustering
• On the Consistency of k-means++ algorithm
• Rademacher Chaos Complexities for Learning the Kernel Problem
• Consistency of regularized spectral clustering

zbMATH Keywords

strong consistencyRademacher complexitykernel \(k\)-means clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Strong consistency of k-means clustering
• Least squares quantization in PCM
• High-Dimensional Statistics
• Title not available (Why is that?)
• Consistency of spectral clustering
• Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
• 10.1162/153244303321897690
• Fast rates for empirical vector quantization
• Individual Convergence Rates in Empirical Vector Quantizer Design
• On the Performance of Clustering in Hilbert Spaces
• The minimax distortion redundancy in empirical quantizer design
• A Vector-Contraction Inequality for Rademacher Complexities

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)