Optimal dyadic decision trees

Machine Learning

Volumn 66, Issue 2-3, 2007, Pages 209-241

  Blanchard, G ^a   Schafer C ^a   Rozenholc, Y ^b   Muller K R ^a,c  

^a FRAUNHOFER FIRST   (Germany)

^b UNIVERSITÉ PARIS DESCARTES   (France)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Adaptive convergence rate; Classification; Decision tree; Density estimation; Oracle inequality

Indexed keywords

ALGORITHMS; DATA REDUCTION; LEARNING SYSTEMS;

ADAPTIVE CONVERGENCE RATE; DENSITY ESTIMATION; ORACLE INEQUALITY;

DECISION TREES;

EID: 33847623752     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-007-0717-6     Document Type: Article

References (22)

1. Adelson-Velskii, G. M., & Landis, E. M. (1962). An algorithm for the organization of information. Soviet Math. Doclady, 3, 1259-1263.
2. Barron, A., Birgé, L., & Massart, P. (1999). Risk bounds for model selection via penalization. Probability Theory and Related Fields, 113, 301-413.
3. Barron, A., & Sheu, C. (1991). Approximation of density functions by sequences of exponential families. Annals of Statistics, 19, 1347-1369.
4. Bartlett, P., Bousquet, O., & Mendelson, S. (2005). Local Rademacher complexities. Annals of Statistics, 33(4), 1497-1537.
5. Blanchard, G. (2004). Different paradigms for choosing sequential reweighting algorithms. Neural Computation, 16, 811-836.
6. Blanchard, G., Bousquet, O., & Massart, P. (2004). Statistical performance of support vector machines. Submitted manuscript.
7. Blanchard, G., Schäfer, C., & Rozenholc, Y. (2004). Oracle bounds and exact algorithm for dyadic classification trees. In J. Shawe-Taylor & Y. Singer (Eds.), Proceedings of the 17th Conference on Learning Theory (COLT 2004), number 3210 in lectures notes in artificial intelligence (pp. 378-392). Springer.
8. Breiman, L. (2001). Random forests. Machine Learning, 45, 5-32.
9. Breiman, L., Friedman, J., Olshen, J., & Stone, C. (1984). Classification and Regression Trees. Wadsworth.
10. Castellan, G. (2000). Histograms selection with an Akaike type criterion. C. R. Acad. Sci., Paris, Sér. I, Math., 330(8), 729-732.
11. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. Wiley series in telecommunications. J. Wiley.
12. Devroye, L., Györfi, L., & Lugosi, G. (1996). A Probabilistic Theory of Pattern Recognition. Number 31 in Applications of Mathematics. New York: Springer.
13. Donoho, D. (1997). Cart and best-ortho-basis: A connection. Annals of Statistics, 25, 1870-1911.
14. Gey, S., & Nédélec, E. (2005). Model selection for CART regression trees. IEEE Transactions on Information Theory, 51(2), 658-670.
15. Györfi, L., Kohler, M., & Krzyzak, A. (2002). A distribution-free theory of nonparametric regression. Springer series in statistics. Springer.
16. Klemelä, J. (2003). Multivariate histograms with data-dependent partitions. Technical report, Institut für angewandte Mathematik, Universität Heidelberg.
17. Massart, P. (2000). Some applications of concentration inequalities in statistics. Ann. Fac. Sci. Toulouse Math., 9(2), 245-303.
18. Mika, S., Rätsch, G., Weston, J., Schölkopf, B., & Müller, K.-R. (1999). Fisher discriminant analysis with kernels. In Y.-H. Hu, J. Larsen, E. Wilson & S. Douglas (Eds.), Neural networks for signal processing IX (pp. 41-48). IEEE.
19. Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo.
20. Rätsch, G., Onoda, T., & Müller, K.-R. (2001). Soft margins for AdaBoost. Machine Learning, 42(3), 287-320. also NeuroCOLT Technical Report NC-TR-1998-021.
21. Scott, C., & Nowak, R. (2004). Near-minimax optimal classification with dyadic classification trees. In S. Thrun, L. Saul & B. Schölkopf (Eds.), Advances in neural information processing systems 16. Cambridge, MA: MIT Press.
22. Scott, C., & Nowak, R. (2006). Minimax optimal classification with dyadic decision trees. IEEE Transactions on Information Theory, 52(4), 1335-1353.