Random projection trees for vector quantization
classification
📊 stat.ML
keywords
quantizationdatadimensionvectorapparentcomputationallydependsdistribution
read the original abstract
A simple and computationally efficient scheme for tree-structured vector quantization is presented. Unlike previous methods, its quantization error depends only on the intrinsic dimension of the data distribution, rather than the apparent dimension of the space in which the data happen to lie.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.