方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯装袋法× | 贝叶斯随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2001 | 2015 |
| 提出者≠ | Clyde, M. & Lee, H. (building on Rubin's Bayesian bootstrap, 1981) | Taddy, M. et al. |
| 类型≠ | Ensemble (Bayesian bootstrap aggregation) | Bayesian ensemble of decision trees |
| 开创性文献≠ | Clyde, M. & Lee, H. (2001). Bagging and the Bayesian bootstrap. In T. Richardson & T. Jaakkola (Eds.), Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics (AISTATS 2001). link ↗ | 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. link ↗ |
| 别名 | Bayesian bootstrap aggregation, BB-ensemble, Bayesian model averaging via bootstrap, Bayesian bagged ensemble | Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest |
| 相关≠ | 6 | 5 |
| 摘要≠ | Bayesian Bagging replaces the classical bootstrap with the Bayesian bootstrap — drawing Dirichlet-distributed weights over training observations rather than sampling with replacement — and trains an ensemble of base learners under those weights. The result is a principled ensemble that approximates a Bayesian posterior over predictions, yielding calibrated uncertainty estimates alongside strong predictive accuracy. | 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. |
| ScholarGate数据集 ↗ |
|
|