Least squares quantization in PCM
Sheelagh Lloyd low
The source holds an abstract for this work, but its best open-access copy is under other-oa, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- Data clustering: 50 years beyond K-means→Least squares quantization in PCMLegacy edge — source detail unavailable
- k-means++: the advantages of careful seeding→Least squares quantization in PCMLegacy edge — source detail unavailable
- Essentials of the self-organizing map→Least squares quantization in PCMLegacy edge — source detail unavailable
- Comparing clusterings—an information based distance→Least squares quantization in PCMLegacy edge — source detail unavailable
- 'Neural-gas' network for vector quantization and its application to time-series prediction→Least squares quantization in PCMLegacy edge — source detail unavailable
- Comparing support vector machines with Gaussian kernels to radial basis function classifi…→Least squares quantization in PCMLegacy edge — source detail unavailable
What cites it, inside the corpus
Links
Download BibTeX · Download RIS · DOI · Open access copy · OpenAlex record
Topics
| Coding theory and cryptography | Computer Science |
| Advanced Wireless Communication Techniques | Engineering |
| Error Correcting Code Techniques | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports1 author record(s) attached.
- supports9 reference(s) recorded.
- supportsThe DOI's year agrees with the publication year.
- supportsA title is present.
Provenance
sha256 7e3d99a592f7f61f…