방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 적층 일반화× | 부스팅 앙상블× | |
|---|---|---|
| 분야 | 앙상블 학습 | 앙상블 학습 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1992 | 1990 |
| 창시자≠ | David Wolpert | Robert Schapire |
| 유형≠ | meta-learning aggregation | sequential ensemble |
| 원전≠ | Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259. DOI ↗ | Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227. DOI ↗ |
| 별칭 | stacking, meta-learning | adaptive boosting, sequential ensemble |
| 관련≠ | 3 | 4 |
| 요약≠ | 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. | Boosting is an ensemble method that sequentially trains weak learners and combines them into a strong predictor by focusing on samples that previous models misclassified. Each new weak learner is weighted according to the difficulty of its training task, and final predictions are made via weighted voting. Pioneered by Schapire (1990) and refined in AdaBoost (Freund & Schapire, 1997), boosting converts weak learners (barely better than random) into strong learners through sequential reweighting. |
| ScholarGate데이터셋 ↗ |
|
|