Strong Consistency of ReducedK-means Clustering
From MaRDI portal
Publication:2932766
DOI10.1111/sjos.12074zbMath1305.62231arXiv1212.4942OpenAlexW2170312859MaRDI QIDQ2932766
Publication date: 9 December 2014
Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.4942
Estimation in multivariate analysis (62H12) Asymptotic properties of nonparametric inference (62G20) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items
Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Subspace clustering for panel data with interactive effects ⋮ On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory ⋮ Strong consistency of factorial \(k\)-means clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Strong consistency of k-means clustering
- A central limit theorem for k-means clustering
- A central limit theorem for multivariate generalized trimmed \(k\)-means
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Strong consistency of factorial \(k\)-means clustering
- Consistency of spectral clustering
- Factorial and reduced \(K\)-means reconsidered
- Consistent selection of the number of clusters via crossvalidation
- On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions
- Unsupervised Curve Clustering using B‐Splines
- Generalizations of the Glivenko-Cantelli Theorem
- The Consistency of Estimators in Finite Mixture Models
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
- Factorial \(k\)-means analysis for two-way data.
This page was built for publication: Strong Consistency of ReducedK-means Clustering