Annals of Applied Statistics
- Ann. Appl. Stat.
- Volume 4, Number 1 (2010), 266-298.
BART: Bayesian additive regression trees
Hugh A. Chipman, Edward I. George, and Robert E. McCulloch
Abstract
We develop a Bayesian “sum-of-trees” model where each tree is constrained by a regularization prior to be a weak learner, and fitting and inference are accomplished via an iterative Bayesian backfitting MCMC algorithm that generates samples from a posterior. Effectively, BART is a nonparametric Bayesian regression approach which uses dimensionally adaptive random basis elements. Motivated by ensemble methods in general, and boosting algorithms in particular, BART is defined by a statistical model: a prior and a likelihood. This approach enables full posterior inference including point and interval estimates of the unknown regression function as well as the marginal effects of potential predictors. By keeping track of predictor inclusion frequencies, BART can also be used for model-free variable selection. BART’s many features are illustrated with a bake-off against competing methods on 42 different data sets, with a simulation experiment and on a drug discovery classification problem.
Article information
Source
Ann. Appl. Stat., Volume 4, Number 1 (2010), 266-298.
Dates
First available in Project Euclid: 11 May 2010
Permanent link to this document
https://projecteuclid.org/euclid.aoas/1273584455
Digital Object Identifier
doi:10.1214/09-AOAS285
Mathematical Reviews number (MathSciNet)
MR2758172
Zentralblatt MATH identifier
1189.62066
Keywords
Bayesian backfitting boosting CART classification ensemble MCMC nonparametric regression probit model random basis regularizatio sum-of-trees model variable selection weak learner
Citation
Chipman, Hugh A.; George, Edward I.; McCulloch, Robert E. BART: Bayesian additive regression trees. Ann. Appl. Stat. 4 (2010), no. 1, 266--298. doi:10.1214/09-AOAS285. https://projecteuclid.org/euclid.aoas/1273584455

