Near-minimax optimal classification with dyadic classification trees

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Scott, Clayton ^a   Nowak, Robert ^b  

^a Rice University   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION RULES; CLASSIFICATION TREES; CONCENTRATION INEQUALITY; OPTIMAL CLASSIFICATION; RATE OF CONVERGENCE; SPATIAL ADAPTIVITY; SPATIAL DECOMPOSITIONS; SPATIALLY ADAPTIVE;

OPTIMIZATION;

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

References (10)

1. C. Scott and R. Nowak, "Dyadic classification trees via structural risk minimization, " in Advances in Neural Information Processing Systems 14, S. Becker, S. Thrun, and K. Obermayer, Eds., Cambridge, MA, 2002, MIT Press.
2. E. Mammen and A. B. Tsybakov, "Smooth discrimination analysis, " Annals of Statistics, vol. 27, pp. 1808-1829, 1999.
3. M. Kearns and Y. Mansour, "A fast, bottom-up decision tree pruning algorithm with nearoptimal generalization, " in International Conference on Machine Learning, 1998, pp. 269-277.
4. Y. Mansour and D. McAllester, "Generalization bounds for decision trees, " in Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, Palo Alto, California, Nicolò Cesa-Bianchi and Sally A. Goldman, Eds., 2000, pp. 69-74.
5. K. Bennett and J. Blue, "A support vector machine approach to decision trees, " in Proceedings of the IEEE International Joint Conference on Neural Networks, Anchorage, Alaska, 1998, vol. 41, pp. 2396-2401.
6. K. Bennett, N. Cristianini, J. Shawe-Taylor, and D. Wu, "Enlarging the margins in perceptron decision trees, " Machine Learning, vol. 41, pp. 295-313, 2000.
7. C. Scott, "Tree pruning using a non-additive penalty, " Tech. Rep. TREE 0301, Rice University, 2003, available athttp://www.dsp.rice.edu/- cscott/pubs.html.
8. A. Barron, "Complexity regularization with application to artificial neural networks, " in Nonparametric functional estimation and related topics, G. Roussas, Ed., pp. 561-576. NATO ASI series, Kluwer Academic Publishers, Dordrecht, 1991.
9. 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/pubs.html.
10. M. Okamoto, "Some inequalities relating to the partial sum of binomial probabilites, " Annals of the Institute of Statistical Mathematics, vol. 10, pp. 29-35, 1958.