Model selection for CART regression trees

IEEE Transactions on Information Theory

Volumn 51, Issue 2, 2005, Pages 658-670

  Gey, Servane ^a   Nedelec, Elodie ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITÉ PARIS SUD   (France)

Author keywords

Bounded regression; CART; Gaussian regression; Model selection; Pruning

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; RANDOM PROCESSES; REGRESSION ANALYSIS; TREES (MATHEMATICS);

BOUNDED REGRESSION; CLASSIFICATION-AND-REGRESSION TREES; GAUSSIAN REGRESSION; MODEL SELECTION; PRUNING ALGORITHM;

INFORMATION THEORY;

EID: 13444271960     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.840903     Document Type: Article

References (17)

1. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification And Regression Trees. London, U.K.: Chapman & Hall, 1984.
2. P. A. Chou. T. Lookabaugh, and R. M. Gray, "Optimal pruning with applications to tree-structured source coding and modeling," IEEE Trans. Inf. Theory, vol. 35, no. 2, pp. 299-315, Mar. 1989.
3. Wernecke, Possinger, Kalb, and Stein, "Validating classification trees," Biometrical J., vol. 40, no. 8, pp. 993-1005, 1998.
4. A. B. Nobel, "Analysis of a complexity-based pruning scheme for classification trees," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2362-2368, Aug. 2002.
5. A. B. Nobel and R. A. Olshen, "Termination and continuity of greedy growing for tree-structured vector quantizers," IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 191-205, Jan. 1996.
6. A. B. Nobel, "Recursive partitioning to reduce distortion," IEEE Trans. Inf. Theory, vol. 43, no. 4, pp. 1122-1133, Jul. 1997.
7. S. B. Gelfand, C. S. Ravishankar, and E. J. Delp, "An iterative growing and pruning algorithm for classification tree design," IEEE Trans. Pattern Anal. Mach. Intel., vol. 13, no. 2, pp. 163-174, Feb. 1991.
8. p Criterion for Gaussian Model Selection," Université Paris, Paris, France, Tech. Rep. 647, 2001.
9. P. Massart, "Some applications of concentration inequalities to statistics," Ann. Faculté des Sciences de Toulouse, 2000.
10. J. Engel, "A simple wavelet approach to nonparametric regression from recursive partitioning schemes," J. Multivariate Anal., vol. 49, pp. 242-254, 1994.
11. D. L. Donoho, "CART and best-ortho-basis: A connection," Ann. Statist., vol 25, no. 5, pp. 1870-1911, 1997.
12. A. B. Nobel, "Histogram regression estimation using data-dependent partitions," Ann. Statist., vol. 24, no. 3, pp. 1084-1105, 1996.
13. V. N. Vladimir, Statistical Learning Theory. New York: Wiley Interscience, 1998.
14. M. Wegkamp, "Model selection in nonparametric regression," Ann. Statist., vol. 31, pp. 252-273, 2003.
15. Y. Baraud, "Model selection for regression on a random design," ESAIM Probability & Statistics. vol. 6, pp. 127-146, 2002.
16. S. Gey and E. Lebarbier, "A CART based algorithm for detection of multiple change points in the mean," unpublished manuscript.
17. Ledoux and Talagrand, Probability in Banach Spaces(Isoperimetry and Processes). Berlin, Germany: Springer-Verlag, 1991.