References
- Akakpo, N. 2012. Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection. Mathematical Methods of Statistics 21 (1):1–28.
- Breiman, L., J. H. Friedman, R. A. Olshen, and C. J. Stone. 1984. Classificationand regression trees. London: Chapman & Hall.
- Devroye, L., L. Györfi, and G. Lugosi. 1996. A probabilistic theory of pattern recognition, volume 31 of Applications of Mathematics (New York). New York: Springer-Verlag.
- Donoho, D. L. 1997. CART and best-ortho-basis : A connection. The Annals of Statistics 25 (5):1870–911.
- Gey, S. 2012. Risk bounds for cart classifiers under a margin condition. Pattern Recognition 45:3523–34.
- Gey, S., and T. Mary Huard. 2012. Risk bounds for embedded variable selection in classification trees. IEEE Transactions on Information Theory 60 (3):1688–99.
- Gey, S., and E. Nedelec. 2005. Model selection for CART regression trees. IEEE Transactions on Information Theory 51 (2):658–70.
- Nobel, A. B. 2002. Analysis of a complexity-based pruning scheme for classification trees. IEEE Transactions on Information Theory 48 (8):2362–8.
- Van Der Vaart, A., and J. A. Wellner. 2009. A note on bounds for vc dimensions. Institute of Mathematical Statistics Collections 5:103.
- Van Der Vaart, A. W., and J. A. Wellner. 1996. Weak convergence and empirical processes. New York: Springer.
- Vapnik, V. N., and A. Y. Chervonenkis. 1971. Theory of uniform convergence of frequencies of events to their probabilities and problems of search for anoptimal solution from empirical data. Avtomat. i Telemeh. 2:42–53.
- Vapnik, V. N., and A. Y. Chervonenkis. 1974. Teoriya raspoznavaniya obrazov. Statisticheskie problemy obucheniya. Moscow: Izdat. “Nauka”.