방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 자기 지도 학습 스태킹 앙상블× | 배깅 앙상블× | |
|---|---|---|
| 분야≠ | 머신러닝 | 앙상블 학습 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1992–2018 | 1996 |
| 창시자≠ | Wolpert, D. H. (stacking); self-supervised extension via modern SSL literature | Leo Breiman |
| 유형≠ | Ensemble meta-learning with self-supervised pretraining | parallel ensemble |
| 원전≠ | 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 ↗ |
| 별칭≠ | SSL stacking, self-supervised stacked generalization, self-supervised meta-ensemble, SSL ensemble stacking | bootstrap aggregating |
| 관련≠ | 6 | 4 |
| 요약≠ | Self-supervised Stacking Ensemble combines stacked generalization — the classic two-level ensemble architecture introduced by Wolpert (1992) — with self-supervised pretraining, allowing base models to learn rich representations from unlabeled data before being fine-tuned and stacked. This hybrid strategy is especially powerful when labeled examples are scarce but unlabeled data is plentiful. | Bagging, short for bootstrap aggregating, is an ensemble method that reduces variance by training multiple copies of a single learning algorithm on different random subsets of the training data. Each subset is created via bootstrap sampling—randomly drawing samples with replacement. Predictions are combined through majority voting (classification) or averaging (regression). Introduced by Leo Breiman in 1996, bagging forms the foundation for random forests and is particularly effective for reducing overfitting in high-variance models. |
| ScholarGate데이터셋 ↗ |
|
|