DeepAI
Log In Sign Up

A Bayesian Decision Tree Algorithm

01/10/2019
by   Giuseppe Nuti, et al.
0

Bayesian Decision Trees are known for their probabilistic interpretability. However, their construction can sometimes be costly. In this article we present a general Bayesian Decision Tree algorithm applicable to both regression and classification problems. The algorithm does not apply Markov Chain Monte Carlo and does not require a pruning step. While it is possible to construct a weighted probability tree space we find that one particular tree, the greedy-modal tree (GMT), explains most of the information contained in the numerical examples. This approach seems to perform similarly to Random Forests.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/10/2019

Efficient Bayesian Decision Tree Algorithm

Bayesian Decision Trees are known for their probabilistic interpretabili...
03/03/2013

Top-down particle filtering for Bayesian decision trees

Decision tree learning is a popular approach for classification and regr...
06/03/2011

An Analysis of Reduced Error Pruning

Top-down induction of decision trees has been observed to suffer from th...
06/16/2016

ACDC: α-Carving Decision Chain for Risk Stratification

In many healthcare settings, intuitive decision rules for risk stratific...
07/26/2022

Single MCMC Chain Parallelisation on Decision Trees

Decision trees are highly famous in machine learning and usually acquire...
09/23/2018

Interaction Detection with Bayesian Decision Tree Ensembles

Methods based on Bayesian decision tree ensembles have proven valuable i...
01/10/2022

A Study on Mitigating Hard Boundaries of Decision-Tree-based Uncertainty Estimates for AI Models

Outcomes of data-driven AI models cannot be assumed to be always correct...