方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯决策树× | 正则化决策树× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1998 | 1984 |
| 提出者≠ | Chipman, H. A.; George, E. I.; McCulloch, R. E. | Breiman, L., Friedman, J., Olshen, R., & Stone, C. |
| 类型≠ | Bayesian ensemble / tree model | Supervised learning (regularized tree) |
| 开创性文献≠ | Chipman, H. A., George, E. I., & McCulloch, R. E. (1998). Bayesian CART model search. Journal of the American Statistical Association, 93(443), 935–948. DOI ↗ | Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and Regression Trees. Wadsworth. ISBN: 978-0-412-04841-8 |
| 别名 | Bayesian CART, BCART, Bayesian tree induction, probabilistic decision tree | pruned decision tree, cost-complexity pruned tree, penalized decision tree, constrained CART |
| 相关≠ | 5 | 6 |
| 摘要≠ | 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 regularized decision tree is a decision tree model whose complexity is intentionally limited through pruning, depth constraints, or penalty terms to prevent overfitting. Rooted in Breiman et al.'s CART framework (1984), regularization converts the greedy tree-growing procedure into a bias-variance tradeoff, yielding models that generalize better to unseen data than fully-grown trees. |
| ScholarGate数据集 ↗ |
|
|