Vertaile menetelmiä

	Bayesiläinen päätöspuu	[UNTRANSLATED: Bayesian Random Forest...]
Tieteenala	Koneoppiminen	Koneoppiminen
Menetelmäperhe	Machine learning	Machine learning
Syntyvuosi	1998	2015
Kehittäjä	Chipman, H. A.; George, E. I.; McCulloch, R. E.	Taddy, M. et al.
Tyyppi	Bayesian ensemble / tree model	Bayesian ensemble of decision trees
Alkuperäislähde	Chipman, H. A., George, E. I., & McCulloch, R. E. (1998). Bayesian CART model search. Journal of the American Statistical Association, 93(443), 935–948.	Taddy, M., Chen, C., Yu, J., & Wyle, M. (2015). Bayesian and Empirical Bayesian Forests. Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), PMLR 37, 967–976.
Rinnakkaisnimet	Bayesian CART, BCART, Bayesian tree induction, probabilistic decision tree	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest
Liittyvät	5	5
Tiivistelmä	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.	Bayesian Random Forest extends the classical random forest by placing a prior distribution over tree structures and leaf parameters, then sampling or approximating the posterior over that ensemble. The result is a set of predictions accompanied by calibrated uncertainty estimates — a capability standard random forests lack — making it valuable when knowing how confident the model is matters as much as the prediction itself.