Termination and continuity of greedy growing for tree-structured vector quantizers

DOI10.1109/18.481789zbMath0851.94011OpenAlexW2144550534MaRDI QIDQ4880001

Andrew B. Nobel, Richard A. Olshen

Publication date: 1 December 1996

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

Full work available at URL: https://semanticscholar.org/paper/175c9dfba68c53bc2f33b1e34bc6b54054dcb7d6

zbMATH Keywords

data compressiongreedy algorithmsvector quantizers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Source coding (94A29)

Related Items (1)

Risk bounds for CART classifiers under a margin condition

This page was built for publication: Termination and continuity of greedy growing for tree-structured vector quantizers