Dyadic classification trees via structural risk minimization

Advances in Neural Information Processing Systems

Volumn , Issue , 2003, Pages

  Scott, Clayton ^a   Nowak, Robert ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; OPTIMIZATION;

BENCHMARK DATASETS; CLASSIFICATION TREES; GROWING AND PRUNING; MINI-MAX SENSE; NEAR OPTIMALITY; NEAR-OPTIMAL PERFORMANCE; STRUCTURAL RISK MINIMIZATION; TRAINING DATA;

RISK ASSESSMENT;

EID: 84898998236     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. L. Breiman, J. Friedman, R. Olshen, and C. Stone, Classification and Regression Trees, Wadsworth, Belmont, CA, 1984.
2. V. Vapnik, Estimation of Dependencies Based on Empirical Data, Springer-Verlag, New York, 1982.
3. G. Lugosi and K. Zeger, "Concept learning using complexity regularization," IEEE Transactions on Information Theory, Vol. 42, no. 1, pp. 48-54, 1996.
4. L. Devroye, L. Györfi, and G. Lugosi, A Probabilistic Theory of Pattern Recognition, Springer, New York, 1996.
5. C. Scott and R. Nowak, "Complexity-regularized dyadic classification trees: Efficient pruning and rates of convergence," Tech. Rep. TREE0201, Rice University, 2002, available at http://www.dsp.rice.edu/~cscott.
6. 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.
7. A. B. Tsybakov, "Optimal aggregation of classifiers in statistical learning," preprint, 2001, available at http://www.proba.jussieu.fr/ mathdoc/preprints/.
8. K. Falconer, Fractal Geometry: Mathematical Foundations and Applications, Wiley, West Sussex, England, 1990.
9. J. S. Marron, "Optimal rates of convergence to Bayes risk in nonparametric discrimination," Annals of Statistics, Vol. 11, no. 4, pp. 1142-1155, 1983.
10. Y Yang, "Minimax nonparametric classification-Part I: Rates of convergence," IEEE Transactions onlnformation Theory, Vol. 45, no. 7, pp. 2271-2284, 1999.
11. E. Mammen and A. B. Tsybakov, "Smooth discrimination analysis," Annals of Statistics, Vol. 27, pp. 1808-1829, 1999.
12. R Chou, T. Lookabaugh, and R. Gray, "Optimal pruning with applications to tree-structured source coding and modeling," IEEE Transactions on Information Theory, Vol. 35, no. 2, pp. 299-315, 1989.
13. B. Ripley, Pattern Recognition and Neural Networks, Cambridge University Press, Cambridge, UK, 1996.
14. R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, 1993.