Cort: Classification or regression trees

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 6, Issue , 2003, Pages 153-156

  Scott, Clayton D ^a   Willett, Rebecca M ^a   Nowak, Robert D ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; REGRESSION ANALYSIS; TREES (MATHEMATICS);

REGRESSION TREES;

SIGNAL PROCESSING;

EID: 0141742703     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. L. Breiman, J. Friedman, R. Olshen, and C. J. Stone, Classification and Regression Trees, Wadsworth, 1983.
2. S. Gey and E. Nedelec, "Model selection for cart regression trees," Preprint available at http://www.math.upsud.fr/biblio/ppo/2001/ppo2001-56.html.
3. D. Donoho, "CART and best-ortho-basis selection: A connection, " Annals of Statistics, vol. 25, pp. 1870-1911, 1997.
4. C. Scott and R. Nowak, "Complexity-regularized dyadic classification trees: Efficient pruning and rates of convergence," Tech. Rep. TREE0201, Rice University, 2002.
5. A. Nobel, "Analysis of a complexity based pruning scheme for classification trees," IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2362-2368, 2002.
6. V. Vapnik, The Nature of Statistical Learning Theory, Springer-Verlag, New York, 1995.
7. L. Devroye, L. Györfi, and G. Lugosi, A Probabilistic Theory of Pattern Recognition, Springer, New York, 1996.
8. R. Willett, "Multiscale analysis for intensity and density estimation," M.S. thesis, Rice University, 2002.
9. E. Kolaczyk and R. Nowak, "Multiscale likelihood analysis and complexity penalized estimation," submitted to Annals of Stat. August, 2001. Available at http://cmc.rice.edu/docs.
10. C. Scott and R. Nowak, "Dyadic classification trees via structural risk minimization," in Neural Information Processing Systems - NIPS 2002, Dec. 9-14, Vancouver, Canada, 2002.