On the uniform concentration bounds and large sample properties of clustering with Bregman divergences
From MaRDI portal
Publication:6541771
Cites work
- scientific article; zbMATH DE number 1523007 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A central limit theorem for k-means clustering
- A simple approach to sparse clustering
- A survey of kernel and spectral methods for clustering
- Clustering with Bregman divergences.
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Introduction to algorithms.
- Least squares quantization in PCM
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the strong consistency of feature-weighted \(k\)-means clustering in a nearmetric space
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Robust Clustering Using Outlier-Sparsity Regularization
- Robust and sparse \(k\)-means clustering for high-dimensional data
- Strong consistency of \(k\)-parameters clustering
- Strong consistency of factorial \(k\)-means clustering
- Strong consistency of k-means clustering
- Strong consistency of reduced \(K\)-means clustering
- Strong consistency of the prototype based clustering in probabilitic space
Cited in
(1)
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)
