On the Performance of Clustering in Hilbert Spaces
From MaRDI portal
Publication:3604446
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
Cited in
(42)- The coefficient regularized regression with random projection
- Quantization and clustering with Bregman divergences
- Empirical risk minimization for heavy-tailed losses
- Medoid splits for efficient random forests in metric spaces
- A notion of stability for \(k\)-means clustering
- Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order
- A quantum algorithm of K-means toward practical use
- On the limits of clustering in high dimensions via cost functions
- Nonasymptotic bounds for vector quantization in Hilbert spaces
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- A Vector-Contraction Inequality for Rademacher Complexities
- A partial overview of the theory of statistics with functional data
- Random projections and Hotelling's \(T^2\) statistics for change detection in high-dimensional data streams
- A \(k\)-points-based distance for robust geometric inference
- Robust Bregman clustering
- Convergence rates of learning algorithms by random projection
- scientific article; zbMATH DE number 475546 (Why is no real title available?)
- Convergence rate of optimal quantization and application to the clustering performance of the empirical measure
- Biclustering analysis of functionals via penalized fusion
- Convergence of the \(k\)-means minimization problem using \(\Gamma\)-convergence
- Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering
- Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma
- Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection
- Fast rates for empirical vector quantization
- \(L_1\)-quantization and clustering in Banach spaces
- Pointwise convergence of the Lloyd I algorithm in higher dimension
- On Hölder fields clustering
- Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
- Posterior asymptotics in Wasserstein metrics on the real line
- A statistical view of clustering performance through the theory of \(U\)-processes
- Projection-based curve clustering
- Clustering, Hamming Embedding, Generalized LSH and the Max Norm
- Learning finite-dimensional coding schemes with nonlinear reconstruction maps
- Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data
- On strong consistency of kernel \(k\)-means: a Rademacher complexity approach
- Wasserstein upper bounds of \(L^p\)-norms for multivariate densities in Besov spaces
- Also for \(k\)-means: more data does not imply better performance
- Dimensionality reduction with subgaussian matrices: a unified theory
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Wasserstein upper bounds of the total variation for smooth densities
- Robust \(k\)-means clustering for distributions with two moments
- Quantization and clustering on Riemannian manifolds with an application to air traffic analysis
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)
