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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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,320
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
Gray, R. M. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50011-5 · Cited by 2,845
Self-citationAn Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Data Structures and Algorithms
(2003) · Series on software engineering and knowledge engineering · doi:10.1142/9789812791245 · Cited by 2,117
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
Parallel models of associative memory
Heath, R. (1982) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(82)90036-0 · Cited by 1,095
Storing Infinite Numbers of Patterns in a Spin-Glass Model of Neural Networks
Amit, D. J., Gutfreund, H., & Sompolinsky, H. (1985) · Physical Review Letters · doi:10.1103/physrevlett.55.1530 · Cited by 1,058
Kanerva, P. (1988) · Medical Entomology and Zoology · Cited by 976
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
Rate distortion theory : a mathematical basis for data compression
Berger, T. (1971) · Prentice Hall eBooks · Cited by 953
The capacity of the Hopfield associative memory
McEliece, R., Posner, E., Rodemich, E., & Venkatesh, S. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057328 · Cited by 910
Vector quantization in speech coding
Makhoul, J., Roucos, S., & Gish, H. (1985) · Proceedings of the IEEE · doi:10.1109/proc.1985.13340 · Cited by 839
Neural Information Processing Systems
Anderson, D. Z. (1988) · neural information processing systems · Cited by 784
The existence of persistent states in the brain
Little, W. A. (1974) · Mathematical Biosciences · doi:10.1016/0025-5564(74)90031-5 · Cited by 657
A universal data compression system
Rissanen, J. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056741 · Cited by 631
Entropy-constrained vector quantization
Chou, P. A., Lookabaugh, T. D., & Gray, R. M. (1989) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.17498 · Cited by 584
Self-citationSpeech coding based upon vector quantization
Buzo, A., Gray, A., Gray, R., & Markel, J. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163445 · Cited by 559
Self-citationA simple neural network generating an interactive memory
Anderson, J. A. (1972) · Mathematical Biosciences · doi:10.1016/0025-5564(72)90075-2 · Cited by 553
Learning Patterns and Pattern Sequences by Self-Organizing Nets of Threshold Elements
Amari, S.-I. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223477 · Cited by 474
Albus, J. S. (1981) · DigitalGeorgetown (Georgetown University Library) · Cited by 448
Associatron-A Model of Associative Memory
Nakano, K. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309133 · Cited by 369
Information capacity of the Hopfield model
Abu-Mostafa, Y., & St. Jacques, J. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057069 · Cited by 267
Abu‐Mostafa, Y. S. (1987) · Cited by 257
Vector quantization: A pattern-matching technique for speech coding
Gersho, A., & Cuperman, V. (1983) · IEEE Communications Magazine · doi:10.1109/mcom.1983.1091516 · Cited by 171
Connectionist Architectures for Artificial Intelligence
Fahlman, & Hinton (1987) · Computer · doi:10.1109/mc.1987.1663364 · Cited by 148
Marr, D., & Thach, W. T. (1991) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4684-6775-8_3 · Cited by 143
Internal representations for associative memory
Baum, E. B., Moody, J. E., & Wilczek, F. A. (1988) · Biological Cybernetics · doi:10.1007/bf00332910 · Cited by 129
Vector Quantizers and Predictive Quantizers for Gauss-Markov Sources
Gray, R. M., & Linde, Y. (1982) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1982.1095471 · Cited by 127
Self-citationVariable block-size image coding
Vaisey, D., & Gersho, A. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1987.1169563 · Cited by 115
Ephraim, Y., & Gray, R. M. (1988) · IEEE Transactions on Information Theory · doi:10.1109/18.9780 · Cited by 88
Self-citationA fast codebook search algorithm for nearest-neighbor pattern matching
Cheng, D.-Y., & Gersho, A. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1986.1169084 · Cited by 73
An 800 bit/s vector quantization LPC vocoder
Wong, D. Y., Juang, B.-H. F., & Gray, A. (1982) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1982.1163960 · Cited by 70
Application of a VLSI Vector Quantization Processor to Real-Time Speech Coding
Davidson, G. A., & Gersho, A. (1986) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.1986.1146287 · Cited by 29
Electronics With Digital and Analog Integrated Circuits
Higgins, R. J. (1983) · CERN Document Server (European Organization for Nuclear Research) · Cited by 15
Comparison between sparsely distributed memory and Hopfield-type neural network models
Keeler, J. D. (1986) · NASA Technical Reports Server (NASA) · Cited by 12
Information capacity of outer-product neural networks
Keeler, J. D. (1987) · Physics Letters A · doi:10.1016/0375-9601(87)90371-9 · Cited by 11
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
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.