The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
BART: Bayesian additive regression trees
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Modern Applied Statistics with S
Venables, W. N., & Ripley, B. D. (2002) · Statistics and Computing · doi:10.1007/978-0-387-21706-2 · Cited by 24,305
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 1×
“These include boosting (Freund & Schapire (1997), Friedman (2001)), random forests (Breiman 2001) and bagging (Breiman 1996), each of which use different techniques to fit a linear combination of trees.”
BackgroundLibsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
An Efficient Method of Estimating Seemingly Unrelated Regressions and Tests for Aggregation Bias
Zellner, A. (1962) · Journal of the American Statistical Association · doi:10.1080/01621459.1962.10480664 · Cited by 8,401
Multivariate Adaptive Regression Splines
Friedman, J. H. (1991) · The Annals of Statistics · doi:10.1214/aos/1176347963 · Cited by 8,000
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
GREEN, P. J. (1995) · Biometrika · doi:10.1093/biomet/82.4.711 · Cited by 5,930
Bayesian Analysis of Binary and Polychotomous Response Data
Albert, J. H., & Chib, S. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10476321 · Cited by 3,167
Shape Quantization and Recognition with Randomized Trees
Amit, Y., & Geman, D. (1997) · Neural Computation · doi:10.1162/neco.1997.9.7.1545 · Cited by 1,275
Bayesian Inference on Network Traffic Using Link Count Data
Tebaldi, C., & West, M. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473707 · Cited by 333
Dension, D. (1998) · Biometrika · doi:10.1093/biomet/85.2.363 · Cited by 315
Bayesian backfitting (with comments and a rejoinder by the authors
Hastie, T. J., & Tibshirani, R. J. (2000) · Statistical Science · doi:10.1214/ss/1009212815 · Cited by 209
Chipman, H. A., George, E. I., & McCulloch, R. E. (2002) · Machine Learning · doi:10.1023/a:1013916107446 · Cited by 181
Self-citationChipman, H., George, E. I., & McCulloch, R. E. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0038 · Cited by 133
Self-citationPredictive Toxicology: Benchmarking Molecular Descriptors and Statistical Methods
Feng, J., Lurati, L., Ouyang, H., Robinson, T., Wang, Y., Yuan, S., & Young, S. S. (2003) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci034032s · Cited by 86
ROCR: Visualizing the Performance of Scoring Classifiers
Sing, T., Sander, O., Beerenwinkel, N., & Lengauer, T. (2005) · doi:10.32614/cran.package.rocr · Cited by 83
Bayesian CART: Prior Specification and Posterior Simulation
Wu, Y., Tjelmeland, H., & West, M. (2007) · Journal of Computational and Graphical Statistics · doi:10.1198/106186007x180426 · Cited by 74
The Bayesian Additive Classification Tree applied to credit risk modelling
Zhang, J. L., & Härdle, W. K. (2009) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2009.11.022 · Cited by 68
Extracting Sequence Features to Predict\nProtein–DNA Interactions: A Comparative Study
Zhou, Q., & Liu, J. S. (2008) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 52
Visualizable and interpretable regression models with good prediction power
Kim, H., Loh, W., Shih, Y., & Chaudhuri, P. (2007) · IIE Transactions · doi:10.1080/07408170600897502 · Cited by 52
Reversal of fortune: a statistical analysis of penalty calls in the National Hockey League
Abrevaya, J. I., & McCulloch, R. (2014) · Journal of Quantitative Analysis in Sports · doi:10.1515/jqas-2013-0067 · Cited by 13
Self-citation
Cited by
Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)
Adadi, A., & Berrada, M. (2018) · IEEE Access · doi:10.1109/access.2018.2870052 · Cited by 6,294
Estimation and Inference of Heterogeneous Treatment Effects using Random Forests
Wager, S., & Athey, S. (2018) · Journal of the American Statistical Association · doi:10.1080/01621459.2017.1319839 · Cited by 2,917
Athey, S., Tibshirani, J., & Wager, S. (2019) · The Annals of Statistics · doi:10.1214/18-aos1709 · Cited by 1,870
Goldstein, A., Kapelner, A., Bleich, J., & Pitkin, E. (2015) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2014.907095 · Cited by 1,861
The State of Applied Econometrics: Causality and Policy Evaluation
Athey, S., & Imbens, G. W. (2017) · Journal of Economic Perspectives · doi:10.1257/jep.31.2.3 · Cited by 1,397
Metadata
- Authors
- Chipman, H. A., George, E. I., & McCulloch, R. E.
- Venue
- The Annals of Applied Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2010-03-01
- Volume
- 4
- Issue
- 1
- Pages
- 266-298
- ISSN
- 1932-6157 (ISSN-L)
- OpenAlex
- W2126292488
- Cited by
- 1,542
- References
- 24
- FWCI
- 15.08
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.