On the Performance of Clustering in Hilbert Spaces

DOI10.1109/TIT.2007.913516zbMath1304.62088OpenAlexW2142766915MaRDI QIDQ3604446

Gérard Biau, Luc P. 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

zbMATH Keywords

clusteringHilbert spacevector quantization\(k\)-meansempirical risk minimizationrandom projections

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Probability theory on linear topological spaces (60B11) Source coding (94A29)

Related Items (33)

Robust Bregman clustering ⋮ Convergence rate of optimal quantization grids and application to empirical measure ⋮ Convergence of the $k$-Means Minimization Problem using $\Gamma$-Convergence ⋮ Projection-based curve clustering ⋮ THE COEFFICIENT REGULARIZED REGRESSION WITH RANDOM PROJECTION ⋮ Fast rates for empirical vector quantization ⋮ Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection ⋮ A partial overview of the theory of statistics with functional data ⋮ A statistical view of clustering performance through the theory of \(U\)-processes ⋮ Empirical risk minimization for heavy-tailed losses ⋮ On Hölder fields clustering ⋮ Also for \(k\)-means: more data does not imply better performance ⋮ A \(k\)-points-based distance for robust geometric inference ⋮ \(L_1\)-quantization and clustering in Banach spaces ⋮ A notion of stability for \(k\)-means clustering ⋮ Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes ⋮ Posterior asymptotics in Wasserstein metrics on the real line ⋮ Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order ⋮ Dimensionality reduction with subgaussian matrices: a unified theory ⋮ Convergence rates of learning algorithms by random projection ⋮ Wasserstein upper bounds of the total variation for smooth densities ⋮ Quantization and clustering on Riemannian manifolds with an application to air traffic analysis ⋮ Quantization and clustering with Bregman divergences ⋮ On the limits of clustering in high dimensions via cost functions ⋮ Robust \(k\)-means clustering for distributions with two moments ⋮ Pointwise Convergence of the Lloyd I Algorithm in Higher Dimension ⋮ A Vector-Contraction Inequality for Rademacher Complexities ⋮ On strong consistency of kernel \(k\)-means: a Rademacher complexity approach ⋮ Biclustering analysis of functionals via penalized fusion ⋮ Nonasymptotic bounds for vector quantization in Hilbert spaces ⋮ A quantum algorithm of K-means toward practical use ⋮ Random projections and Hotelling’s T2 statistics for change detection in high-dimensional data streams ⋮ Learning Finite-Dimensional Coding Schemes with Nonlinear Reconstruction Maps

This page was built for publication: On the Performance of Clustering in Hilbert Spaces