方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 集成决策树× | 投票集成 (Voting Ensemble)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996–2000 | 1990s–2004 |
| 提出者≠ | Breiman, L.; Dietterich, T. G. | Lam & Suen; Kuncheva, L. I. (systematic treatment) |
| 类型≠ | Ensemble (multiple decision trees combined) | Ensemble (combination of multiple classifiers by vote) |
| 开创性文献≠ | 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 ↗ | Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8 |
| 别名 | decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees) | majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble |
| 相关≠ | 6 | 5 |
| 摘要≠ | 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. | A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted. |
| ScholarGate数据集 ↗ |
|
|