On the uniform concentration bounds and large sample properties of clustering with Bregman divergences

DOI10.1002/STA4.360MaRDI QIDQ6541771FDOQ6541771

Debolina Paul, Saptarshi Chakraborty, Swagatam Das

Publication date: 21 May 2024

Published in: Stat (Search for Journal in Brave)

zbMATH Keywords

clusteringstrong consistencyrate of convergenceBregman divergenceVC theoryuniform deviation bounds

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Strong consistency of k-means clustering
• Least squares quantization in PCM
• Introduction to algorithms.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Clustering with Bregman divergences.
• Title not available (Why is that?)
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• A simple approach to sparse clustering
• Robust and sparse \(k\)-means clustering for high-dimensional data
• Robust Clustering Using Outlier-Sparsity Regularization
• A central limit theorem for k-means clustering
• A survey of kernel and spectral methods for clustering
• Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
• Strong consistency of \(k\)-parameters clustering
• Title not available (Why is that?)
• Strong consistency of factorial \(k\)-means clustering
• Strong Consistency of ReducedK-means Clustering
• Title not available (Why is that?)
• On the strong consistency of feature-weighted \(k\)-means clustering in a nearmetric space

Cited In (1)

• Upper bound estimations of misclassification rate in the heteroscedastic clustering model with sub-Gaussian noises

This page was built for publication: On the uniform concentration bounds and large sample properties of clustering with Bregman divergences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541771)