Reinforcement Learning Trees

Journal of the American Statistical Association

Volumn 110, Issue 512, 2015, Pages 1770-1784

  Zhu, Ruoqing ^a   Zeng, Donglin ^a   Kosorok, Michael R ^a  

^a University of North Carolina at Chapel Hill   (United States)

Author keywords

Consistency; Error bound; Random forests; Reinforcement learning; Trees

Indexed keywords

EID: 84954421092     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1080/01621459.2015.1036994     Document Type: Article

References (28)

1. Y.Amit,, and D.Geman, (1997), “Shape Quantization and Recognition With Randomized Trees,” Neural Computing, 9, 1545–1588.
2. G.Biau, (2012), “Analysis of a Random Forests Model,” Journal of Machine Learning Research, 13, 1063–1095.
3. G.Biau,, L.Devroye,, and G.Lugosi, (2008), “Consistency of Random Forests and Other Averaging Classifiers,” Journal of Machine Learning Research, 9, 2015–2033.
4. L.Breiman, (1996), “Bagging Predictors,” Machine Learning, 24, 123–140.
5. L.Breiman, (2000), “Some Infinity Theory for Predictor Ensembles,” Technical Report 577, Department of Statistics, University of California, Berkeley.
6. L.Breiman, (2001), “Random Forests,” Machine Learning, 45, 5–32.
7. L.Breiman,, J.Friedman,, R.Olshen,, and C.Stone, (1984), Classification and Regression Trees, Pacific Grove, CA: Wadsworth International.
8. A.Bureau,, J.Dupuis,, K.Falls,, K.L.Lunetta,, B.Hayward,, T.P.Keith,, and P.Van Eerdewegh, (2005), “Identifying SNPs Predictive of Phenotype Using Random Forests,” Genetic Epidemiology, 28, 171–182.
9. H.A.Chipman,, E.I.George,, and R.E.McCulloch, (2010), “BART: Bayesian Additive Regression Trees,” Annals of Applied Statistics, 4, 266–298.
10. A.Cutler,, and G.Zhao, (2001), “PERT-Perfect Random Tree Ensembles,” Computing Science and Statistics, 33, 490–497.
11. R.Díaz-Uriarte,, and S.A.De Andres, (2006), “Gene Selection and Classification of Microarray Data Using Random Forest,” BMC Bioinformatics, 7, 3.
12. T.Dietterich, (2000), “An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting and Randomization,” Machine Learning, 40, 139–157.
13. Friedman, J. H. (2001), “Greedy Function Approximation: A Gradient Boosting Machine,” Annals of Statistics, 29, 1189--1232.
14. Friedman, J. H., Hastie, T., and Tibshirani, R. (2010), “Regularization Paths for Generalized Linear Models via Coordinate Descent,” Journal of Statistical Software, 33, 1--22.
15. P.Geurts,, D.Ernst,, and L.Wehenkel, (2006), “Extremely Randomized Trees,” Machine Learning, 63, 3–42.
16. H.Ishwaran,, U.B.Kogalur,, E.H.Blackstone,, and M.S.Lauer, (2008), “Random Survival Forests,” The Annals of Applied Statistics, 2, 841–860.
17. H.Kim,, and W.-Y.Loh, (2001), “Classification Trees With Unbiased Multiway Splits,” Journal of the American Statistical Association, 96, 589–604.
18. Y.Lin,, and Y.Jeon, (2006), “Random Forests and Adaptive Nearest Neighbors,” Journal of the American Statistical Association, 101, 578–590.
19. K.L.Lunetta,, L.B.Hayward,, J.Segal,, and P.Van Eerdewegh, (2004), “Screening Large-Scale Association Study Data: Exploiting Interactions Using Random Forests,” BMC Genetics, 5, 32.
20. K.V.S.Murthy,, and S.L.Salzberg, (1995), “On Growing Better Decision Trees From Data,” Ph.D. dissertation, Johns Hopkins University, Baltimore, MD.
21. S.K.Murthy,, S.Kasif,, and S.Salzberg, (1994), “A System for Induction of Oblique Decision Trees,” arXiv preprint cs/9408103.
22. A.Statnikov,, L.Wang,, and C.F.Aliferis, (2008), “A Comprehensive Comparison of Random Forests and Support Vector Machines for Microarray-Based Cancer Classification,” BMC Bioinformatics, 9, 319.
23. C.Strobl,, A.-L.Boulesteix,, A.Zeileis,, and T.Hothorn, (2007), “Bias in Random Forest Variable Importance Measures: Illustrations, Sources and a Solution,” BMC Bioinformatics, 8, 25.
24. R.S.Sutton,, and A.G.Barto, (1998), Reinforcement Learning: An Introduction, Cambridge, MA: MIT Press.
25. R.Tibshirani, (1996), “Regression Shrinkage and Selection via the Lasso,” Journal of the Royal Statistical Society, Series B, 58, 267–288.
26. A.van der Vaart,, and J.Wellner, (1996), Weak Convergence and Empirical Processes: With Applications to Statistics, New York: Springer.
27. P.Zhao,, and B.Yu, (2006), “On Model Selection Consistency of Lasso,” Journal of Machine Learning Research, 7, 2541–2563.
28. R.Zhu,, and M.R.Kosorok, (2012), “Recursively Imputed Survival Trees,” Journal of the American Statistical Association, 107, 331–340.