The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Optimal pruning with applications to tree-structured source coding and modeling
Abstract
An algorithm introduced by L. Breiman et al. (1984) in the context of classification and regression trees is reinterpreted and extended to cover a variety of applications in source coding and modeling in which trees are involved. These include variable-rate and minimum-entropy tree-structured vector quantization, minimum expected cost decision trees, variable-order Markov modeling, optimum bit allocation, and computer graphics and image processing using quadtrees. A concentration on the first of these and a detailed analysis of variable-rate tree-structured vector quantization are provided. It is found that variable-rate tree-structured vector quantization outperforms not only the fixed-rate variety but also full-search vector quantization. The successive approximation character of variable-rate tree-structured vector quantization permits it to degrade gracefully if the rate is reduced at the encoder. This has applications to the problem of buffer overflow.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Self-citationHopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Cited by
A survey of decision tree classifier methodology
Safavian, S. R., & Landgrebe, D. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.97458 · Cited by 3,808
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Self-citationLemon, S. C., Roy, J., Clark, M. A., Friedmann, P. D., & Rakowski, W. (2003) · Annals of Behavioral Medicine · doi:10.1207/s15324796abm2603_02 · Cited by 878
Rose, K. (1998) · Proceedings of the IEEE · doi:10.1109/5.726788 · Cited by 876
Rate-distortion methods for image and video compression
Ortego, A., & Ramchandran, K. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733495 · Cited by 808
HEVC Complexity and Implementation Analysis
Bossen, F., Bross, B., Suhring, K., & Flynn, D. (2012) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2012.2221255 · Cited by 759
Best wavelet packet bases in a rate-distortion sense
Ramchandran, K., & Vetterli, M. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.217221 · Cited by 679
Rate-distortion optimized streaming of packetized media
Chou, P. A., & Miao, Z. (2006) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2005.864313 · Cited by 667
Self-citationNeural Networks and Related Methods for Classification
Ripley, B. D. (1994) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1994.tb01990.x · Cited by 627
Random projection trees and low dimensional manifolds
Dasgupta, S., & Freund, Y. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374452 · Cited by 375
Automatic labeling of prosodic patterns
Wightman, C. W., & Ostendorf, M. (1994) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.326607 · Cited by 275
The effects of multiview depth video compression on multiview rendering
Merkle, P., Morvan, Y., Smolic, A., Farin, D., Müller, K., de With, P. H. N., & Wiegand, T. (2009) · Signal Processing: Image Communication · doi:10.1016/j.image.2008.10.010 · Cited by 254
Metadata
- Authors
- Chou, P. A., Lookabaugh, T., & Gray, R. M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1989-03
- Volume
- 35
- Issue
- 2
- Pages
- 299-315
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2130305844
- Cited by
- 407
- References
- 45
- FWCI
- 22.92
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.