On the Performance of Clustering in Hilbert Spaces
DOI10.1109/TIT.2007.913516zbMATH Open1304.62088OpenAlexW2142766915MaRDI QIDQ3604446FDOQ3604446
Authors: Gérard Biau, Luc Devroye, Gábor Lugosi 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2007.913516
Recommendations
- Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering
- Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering
- On Hölder fields clustering
- Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma
- scientific article; zbMATH DE number 954488
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Probability theory on linear topological spaces (60B11) Source coding (94A29)
Cited In (37)
- Robust Bregman clustering
- Learning Finite-Dimensional Coding Schemes with Nonlinear Reconstruction Maps
- Wasserstein upper bounds of \(L^p\)-norms for multivariate densities in Besov spaces
- Convergence rate of optimal quantization grids and application to empirical measure
- Dimensionality reduction with subgaussian matrices: a unified theory
- On the limits of clustering in high dimensions via cost functions
- Posterior asymptotics in Wasserstein metrics on the real line
- Wasserstein upper bounds of the total variation for smooth densities
- Projection-based curve clustering
- Nonasymptotic bounds for vector quantization in Hilbert spaces
- A \(k\)-points-based distance for robust geometric inference
- Robust \(k\)-means clustering for distributions with two moments
- Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection
- Clustering, Hamming Embedding, Generalized LSH and the Max Norm
- Medoid splits for efficient random forests in metric spaces
- Pointwise convergence of the Lloyd I algorithm in higher dimension
- Convergence rates of learning algorithms by random projection
- Quantization and clustering on Riemannian manifolds with an application to air traffic analysis
- Convergence of the $k$-Means Minimization Problem using $\Gamma$-Convergence
- Random projections and Hotelling's \(T^2\) statistics for change detection in high-dimensional data streams
- A partial overview of the theory of statistics with functional data
- Fast rates for empirical vector quantization
- Empirical risk minimization for heavy-tailed losses
- On strong consistency of kernel \(k\)-means: a Rademacher complexity approach
- Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order
- \(L_1\)-quantization and clustering in Banach spaces
- Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes
- A notion of stability for \(k\)-means clustering
- A Vector-Contraction Inequality for Rademacher Complexities
- A statistical view of clustering performance through the theory of \(U\)-processes
- Quantization and clustering with Bregman divergences
- Biclustering analysis of functionals via penalized fusion
- The coefficient regularized regression with random projection
- Title not available (Why is that?)
- On Hölder fields clustering
- A quantum algorithm of K-means toward practical use
- Also for \(k\)-means: more data does not imply better performance
This page was built for publication: On the Performance of Clustering in Hilbert Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604446)
