Reinforcement Learning Trees

REFERENCES

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