方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 集成决策树× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996–2000 | 2001 |
| 提出者≠ | Breiman, L.; Dietterich, T. G. | Breiman, L. |
| 类型≠ | Ensemble (multiple decision trees combined) | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Dietterich, T. G. (2000). Ensemble methods in machine learning. In Multiple Classifier Systems, Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer, Berlin, Heidelberg. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees) | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 6 | 4 |
| 摘要≠ | Ensemble Decision Tree methods train multiple decision trees and combine their outputs to produce predictions that are more accurate and stable than any single tree. Covering strategies such as bagging, random subspacing, and voting, they are among the most effective off-the-shelf techniques for tabular classification and regression tasks. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGate数据集 ↗ |
|
|