Recursive partitioning to reduce distortion

DOI10.1109/18.605573zbMath0878.94041OpenAlexW2102742141MaRDI QIDQ4345606

Andrew B. Nobel

Publication date: 5 January 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/956629b4b4ad22a2cc15a2e79ad7b09375bdd0e9

zbMATH Keywords

asymptotic distortion of quantizersdata-compression schemestree-structured vector quantizersunsupervised procedures

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (4)

Risk bounds for CART classifiers under a margin condition ⋮ Information divergence estimation based on data-dependent partitions ⋮ Consistency of data-driven histogram methods for density estimation and classification ⋮ On signal representations within the Bayes decision framework

This page was built for publication: Recursive partitioning to reduce distortion