方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 投票集成 (Voting Ensemble)× | 极端随机树 (Extra Trees)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1990s–2004 | 2006 |
| 提出者≠ | Lam & Suen; Kuncheva, L. I. (systematic treatment) | Geurts, P.; Ernst, D.; Wehenkel, L. |
| 类型≠ | Ensemble (combination of multiple classifiers by vote) | Ensemble (extremely randomized decision trees) |
| 开创性文献≠ | Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8 | Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗ |
| 别名 | majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble | Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET |
| 相关 | 5 | 5 |
| 摘要≠ | 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. | Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time. |
| ScholarGate数据集 ↗ |
|
|