Quantization and the method of<tex>k</tex>-means
From MaRDI portal
Publication:3932727
DOI10.1109/TIT.1982.1056481zbMath0476.94010OpenAlexW2060640288MaRDI QIDQ3932727
No author found.
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1982.1056481
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Central limit and other weak theorems (60F05) Information theory (general) (94A15)
Related Items (40)
Local invariance principles and their application to density estimation ⋮ Alternative learning vector quantization ⋮ Local convergence of the fuzzy c-means algorithms ⋮ Convergence rate of optimal quantization grids and application to empirical measure ⋮ Asymptotics of \(k\)-mean clustering under non-i.i.d. sampling ⋮ A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering ⋮ Asymptotics for Semidiscrete Entropic Optimal Transport ⋮ Optimal Delaunay and Voronoi Quantization Schemes for Pricing American Style Options ⋮ Gaussian-kernel \(c\)-means clustering algorithms ⋮ Fast rates for empirical vector quantization ⋮ Least upper bound of the exact formula for optimal quantization of some uniform Cantor distributions ⋮ Spatial point processes in astronomy ⋮ Statistical learning guarantees for compressive clustering and compressive mixture modeling ⋮ \(k\)-means clustering of extremes ⋮ Asymptotic optimality of scalar Gersho quantizers ⋮ Strong consistency of \(k\)-parameters clustering ⋮ Empirical risk minimization for heavy-tailed losses ⋮ Gaussian-kernel c-means clustering algorithms ⋮ On Hölder fields clustering ⋮ Hierarchical optimal transport for unsupervised domain adaptation ⋮ A Result on Multidimensional Quantization ⋮ A robust EM clustering algorithm for Gaussian mixture models ⋮ \(L_1\)-quantization and clustering in Banach spaces ⋮ A notion of stability for \(k\)-means clustering ⋮ Sample-weighted clustering methods ⋮ Vector quantization and clustering in the presence of censoring ⋮ Weak limit theorems for univariate \(k\)-mean clustering under a nonregular condition ⋮ Bias-correction fuzzy clustering algorithms ⋮ Optimal vector quantization in terms of Wasserstein distance ⋮ Quantization and clustering with Bregman divergences ⋮ Customer Learning in Call Centers from Previous Waiting Experiences ⋮ A General Hybrid Clustering Technique ⋮ High precision numerical computation of principal points for univariate distributions ⋮ Some remarks on the existence of optimal quantizers ⋮ Design of Information Channels for Optimization and Stabilization in Networked Control ⋮ Cluster analysis for cognitive diagnosis: theory and applications ⋮ Unnamed Item ⋮ Strong consistency of factorial \(k\)-means clustering ⋮ Learning Finite-Dimensional Coding Schemes with Nonlinear Reconstruction Maps ⋮ On some significance tests in cluster analysis
This page was built for publication: Quantization and the method of<tex>k</tex>-means
