Bayesian Treed Models
Abstract
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition of the data, and then use a separate simple model within each subset of the partition. Such an alternative is provided by a treed model which uses a binary tree to identify such a partition. However, treed models go further than conventional trees (e.g. CART, C4.5) by fitting models rather than a simple mean or proportion within each subset. In this paper, we propose a Bayesian approach for finding and fitting parametric treed models, in particular focusing on Bayesian treed regression. The potential of this approach is illustrated by a cross-validation comparison of predictive performance with neural nets, MARS, and conventional trees on simulated and real data sets.
Cite
Text
Chipman et al. "Bayesian Treed Models." Machine Learning, 2002. doi:10.1023/A:1013916107446Markdown
[Chipman et al. "Bayesian Treed Models." Machine Learning, 2002.](https://mlanthology.org/mlj/2002/chipman2002mlj-bayesian/) doi:10.1023/A:1013916107446BibTeX
@article{chipman2002mlj-bayesian,
title = {{Bayesian Treed Models}},
author = {Chipman, Hugh A. and George, Edward I. and McCulloch, Robert E.},
journal = {Machine Learning},
year = {2002},
pages = {299-320},
doi = {10.1023/A:1013916107446},
volume = {48},
url = {https://mlanthology.org/mlj/2002/chipman2002mlj-bayesian/}
}