Porównaj metody

	Bayesian Decision Tree	Drzewo decyzyjne
Dziedzina	Uczenie maszynowe	Uczenie maszynowe
Rodzina	Machine learning	Machine learning
Rok powstania	1998	1984
Twórca	Chipman, H. A.; George, E. I.; McCulloch, R. E.	Breiman, Friedman, Olshen & Stone
Typ	Bayesian ensemble / tree model	Recursive partitioning (if-then rules)
Źródło pierwotne	Chipman, H. A., George, E. I., & McCulloch, R. E. (1998). Bayesian CART model search. Journal of the American Statistical Association, 93(443), 935–948.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.
Inne nazwy	Bayesian CART, BCART, Bayesian tree induction, probabilistic decision tree	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
Pokrewne	5	5
Podsumowanie	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.	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.