Recursive partitioning to reduce distortion

IEEE Transactions on Information Theory

Volumn 43, Issue 4, 1997, Pages 1122-1133

  Nobel, Andrew B ^a,b  

^a IEEE   (United States)

^b University of North Carolina at Chapel Hill   (United States)

Author keywords

Data compression; Recursive partitioning; Tree structured vector quantizers; Unsupervised procedures

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; RECURSIVE FUNCTIONS; SIGNAL DISTORTION; TREES (MATHEMATICS); VECTOR QUANTIZATION;

RECURSIVE PARTITIONING; UNSUPERVISED PROCEDURES;

DATA COMPRESSION;

EID: 0031191356     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.605573     Document Type: Article

References (33)

1. T. W. Anderson, "Some nonparametric multivariate procedures based on statistically equivalent blocks," in P. R. Krishnaiah, Ed., Multivariate Analysis. New York: Academic, 1966, pp. 5-27.
2. M. Balakrishnan, "Variable rate structured vector quantization and applications to multiresolution image coding," Ph.D. dissertation, Rensselaer Polytech. Inst., Troy, NY, 1991.
3. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Belmont, CA: Wadsworth, 1984.
4. J. H. Butler, E. A. Gilpin, L. Gordon, and R. A. Olshen, "Tree-structured survival analysis, II," Tech. Rep. 133, Div. Biostat., Stanford Univ., Stanford, CA, Sept. 1989.
5. A. Buzo, A. H. Gray, R. M. Gray, and J. D. Markel, "Speech coding based upon vector quantization," IEEE Trans. Acoust. Speech, Signal Processing, vol. ASSP-28, pp. 562-574, 1980.
6. P. A. Chou, "Applications of information theory to pattern recognition and the design of decision trees and trellises," Ph.D. dissertation, Inform. Syst. Lab, Stanford Univ., Stanford, CA, 1988.
7. P. A. Chou, T. Lookabaugh, and R. M. Gray, "Optimal pruning with applications to tree-structered source coding and modeling," IEEE Trans. Inform. Theory, vol. 37, pp. 31-42, 1989.
8. J. DeHardt, "Generalizations of the Glivenko-Cantelli theorem," Ann. Math. Statist., vol. 42, pp. 2050-2055, 1971.
9. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Boston, MA: Kluwer, 1992.
10. L. Gordon and R. Olshen, "Asymptotically efficient solutions to the classification problem," Ann. Statist., vol. 6, pp. 515-533, 1978.
11. _, "Consistent nonparametric regression from recursive partitioning schemes," J. Multivariate Anal., vol. 10, pp. 611-627, 1980.
12. _, "Almost sure consistent nonparametric regression from recursive partitioning schemes," J. Multivariate Anal., vol. 15, pp. 147-163, 1984.
13. M. LeBlanc and J. Crowley, "Survival trees by goodness of split," J. Amer. Statist. Assoc., vol. 88, pp. 457-467, 1993.
14. Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., vol. COM-28, pp. 84-95, 1980.
15. D. G. Luenberger. Optimization by Vector Space Methods. New York: Wiley, 1969.
16. G. Lugosi and A. B. Nobel, "Consistency of data-driven histogram methods for density estimation and classification," 1996, to be published in Ann. Statist.
17. J. Makhoul, S. Roucos, and H. Gish, "Vector quantization in speech coding," Proc. IEEE, vol. 73, pp. 1551-1558, Nov. 1985.
18. J. N. Morgan and J. A. Sonquist, "Problems in the analysis of survey data and a proposal," J. Amer. Statist. Assoc., vol. 58, pp. 415-435, 1963.
19. S. K. Murthy, S. Kasif, and S. Salzberg, "A system for induction of obliques decision trees," J. Artificial Intell. Res., vol. 2, pp. 1-32, 1994.
20. A. B. Nobel, "On uniform laws of averages," Ph.D. dissertation, Inform. Syst. Lab, Stanford Univ., Stanford, CA, 1992.
21. _, "Histogram regression estimation using data-dependent partitions," 1996, to be published in Ann. Statist..
22. _, "Vanishing distortion and shrinking cells," IEEE Trans. Inform. Theory, vol. 42, pp. 1303-1305, 1996.
23. A. B. Nobel and R. A. Olshen, "Termination and continuity of greedy growing for tree structured vector quantizers," IEEE Trans. Inform. Theory, vol. 42, pp. 1-15, 1996.
24. E. A. Patrick and F. P. Fisher, "Introduction to the performance of distribution-free conditional risk learning systems," Tech. Rep. TR-EE-67-12, Purdue Univ., West Lafayette, IN, 1967.
25. D. Pollard, "Strong consistency of k-means clustering," Ann. Statist., vol. 9, pp. 135-140, 1981.
26. _, "A central limit theorem for k-means clustering," Ann. Probab., vol. 10, pp. 919-926, 1982.
27. _, "Quantization and the method of k-means," IEEE Trans. Inform. Theory, vol. IT-28, no. 2, pp. 199-205, 1982.
28. _, Convergence of Stochastic Processes. New York: Springer, 1984.
29. R. R. Rao, "Relations between weak and uniform convergence of measures with applications," Ann. Math. Statist., vol. 33, pp. 659-680, 1962.
30. E. A. Riskin. "Variable rate vector quantization of images," Ph.D. dissertation, Inform. Syst. Lab, Stanford Univ., Stanford, CA, 1990.
31. E. A. Riskin and R. M. Gray, "A greedy growing algorithm for the design of variable rate vector quantizers," IEEE Trans. Signal Processing, vol. 39, pp. 2500-2507, 1991.
32. M. Sabin and R. M. Gray, "Global convergenc eand empirical consistency of the generalized Lloyd algorithm," IEEE Trans. Inform. Theory, vol. IT-32, 1986.
33. J. Sonquist, "Multivariate model building: The validation of a search strategy," Tech. Rep., Inst. Social Res., Univ. of Michigan, Ann Arbor, 1970.