Quantization and the method ofk-means
- 1 March 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (2), 199-205
- https://doi.org/10.1109/tit.1982.1056481
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Distances of Probability Measures and Random VariablesPublished by Springer Science and Business Media LLC ,2010
- A Central Limit Theorem for $k$-Means ClusteringThe Annals of Probability, 1982
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- Limit theorems for empirical processesProbability Theory and Related Fields, 1981
- Strong Consistency of $K$-Means ClusteringThe Annals of Statistics, 1981
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- Glivenko–Cantelli theorems for classes of convex setsAdvances in Applied Probability, 1979
- Empirical Processes: A Survey of Results for Independent and Identically Distributed Random VariablesThe Annals of Probability, 1979
- Asymptotic Distributions for Clustering CriteriaThe Annals of Statistics, 1978
- A Generalization of Ornstein's $\bar d$ Distance with Applications to Information TheoryThe Annals of Probability, 1975