방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 로버스트 스태킹 앙상블× | 부스팅× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1992 (stacking); robust variants 2000s–present | 1990–1997 |
| 창시자≠ | Wolpert, D. H. (stacking); robust extensions by multiple authors | Schapire, R. E.; Freund, Y. |
| 유형≠ | Ensemble (stacking with robust meta-learner) | Sequential ensemble (iterative reweighting) |
| 원전≠ | Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| 별칭 | robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learner | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| 관련≠ | 5 | 6 |
| 요약≠ | Robust Stacking Ensemble extends classical stacked generalization by replacing the ordinary meta-learner with a robust estimator — such as a Huber-loss regressor, quantile regression, or a model trained on trimmed residuals — so that the ensemble's combination layer is resistant to outliers and noisy base-learner predictions. It improves predictive accuracy and reliability on real-world datasets with contaminated labels or heavy-tailed error distributions. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGate데이터셋 ↗ |
|
|