BART Procedure

References

  • Asuncion, A., and Newman, D. J. (2007). “UCI Machine Learning Repository.” http://archive.ics.uci.edu/ml/.

  • Breiman, L. (1996). “Bagging Predictors.” Machine Learning 24:123–140.

  • Breiman, L. (2001). “Random Forests.” Machine Learning 45:5–32.

  • Chipman, H. A., George, E. I., and McCulloch, R. E. (1998). “Bayesian CART Model Search.” Journal of the American Statistical Association 93:935–948. https://doi.org/10.2307/2669832.

  • Chipman, H. A., George, E. I., and McCulloch, R. E. (2010). “BART: Bayesian Additive Regression Trees.” Annals of Applied Statistics 4:266–298. https://doi.org/10.1214/09-AOAS285.

  • Friedman, J. H. (2001). “Greedy Function Approximation: A Gradient Boosting Machine.” Annals of Statistics 29:1189–1232.

  • Lane, P. W., and Nelder, J. A. (1982). “Analysis of Covariance and Standardization as Instances of Prediction.” Biometrics 38:613–621.

  • Pratola, M. T., Chipman, H. A., Gattiker, J. R., Higdon, D. M., McCulloch, R. E., and Rust, W. N. (2014). “Parallel Bayesian Additive Regression Trees.” Journal of Computational and Graphical Statistics 23:830–852. https://doi.org/10.1080/10618600.2013.841584.

Last updated: May 14, 2026