方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 堆叠泛化× | 多数表决× | |
|---|---|---|
| 领域 | 集成学习 | 集成学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1992 | 1996 |
| 提出者≠ | David Wolpert | Leo Breiman |
| 类型≠ | meta-learning aggregation | voting aggregation |
| 开创性文献≠ | Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259. DOI ↗ | Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140. DOI ↗ |
| 别名≠ | stacking, meta-learning | hard voting |
| 相关≠ | 3 | 5 |
| 摘要≠ | Stacked generalization, or stacking, is a two-level ensemble method where base-level classifiers are trained on the original data, and a meta-learner is trained on the predictions of the base classifiers. The meta-learner learns how to best combine base predictions rather than using fixed aggregation rules. Introduced by David Wolpert in 1992, stacking achieves state-of-the-art performance by automatically learning the optimal weighting and interaction patterns among base models. | Majority voting is an ensemble method that combines predictions from multiple base classifiers by selecting the class that receives the most votes. Each base classifier casts one vote for a predicted class, and the final prediction is the class with the majority (plurality). This approach was formalized by Leo Breiman and colleagues in the 1990s as a simple yet effective way to improve classification accuracy. |
| ScholarGate数据集 ↗ |
|
|