পদ্ধতির তুলনা করুন

	বেয়েশীয় র্যান্ডম ফরেস্ট	Bayesian Active Learning
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2015	1992–2011
প্রবর্তক	Taddy, M. et al.	MacKay, D.J.C.; Houlsby, N. et al.
ধরন	Bayesian ensemble of decision trees	Active learning with Bayesian uncertainty
মৌলিক উৎস	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.	Houlsby, N., Huszár, F., Ghahramani, Z., & Lengyel, M. (2011). Bayesian Active Learning for Classification and Preference Learning. arXiv preprint arXiv:1112.5745.
অপর নাম	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest	BAL, Bayesian optimal experimental design for ML, BALD (Bayesian Active Learning by Disagreement), probabilistic active learning
সম্পর্কিত	5	6
সারসংক্ষেপ	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.	Bayesian Active Learning (BAL) combines a probabilistic model with an active query strategy to identify the unlabeled examples that, once labeled, would most reduce model uncertainty. Instead of labeling data at random, BAL guides an oracle — typically a human annotator — toward the points where labeling will provide the greatest information gain, making it highly label-efficient.