방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 다수결 투표× | 적층 일반화× | |
|---|---|---|
| 분야 | 앙상블 학습 | 앙상블 학습 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1996 | 1992 |
| 창시자≠ | Leo Breiman | David Wolpert |
| 유형≠ | voting aggregation | meta-learning aggregation |
| 원전≠ | Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140. DOI ↗ | Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259. DOI ↗ |
| 별칭≠ | hard voting | stacking, meta-learning |
| 관련≠ | 5 | 3 |
| 요약≠ | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|