Machine learningMachine learning

Bayesian Decision Tree

Bayesian Decision Tree (Bayesian CART) places a prior distribution over tree structures and leaf parameters, then uses Markov chain Monte Carlo to explore the posterior distribution of trees given data. Instead of a single best tree, it produces a distribution of plausible trees whose predictions are averaged, yielding calibrated uncertainty estimates alongside point predictions.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Chipman, H. A., George, E. I., & McCulloch, R. E. (1998). Bayesian CART model search. Journal of the American Statistical Association, 93(443), 935–948. DOI: 10.1080/01621459.1998.10473750
  2. Denison, D. G. T., Mallick, B. K., & Smith, A. F. M. (1998). A Bayesian CART algorithm. Biometrika, 85(2), 363–377. DOI: 10.1093/biomet/85.2.363

Related methods

Referenced by

ScholarGateBayesian Decision Tree (Bayesian Decision Tree (Bayesian CART)). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/bayesian-decision-tree