방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 준지도 학습 스태킹 앙상블× | 배깅 앙상블× | |
|---|---|---|
| 분야≠ | 머신러닝 | 앙상블 학습 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2000s–2010s | 1996 |
| 창시자≠ | Combines Wolpert (1992) stacking with semi-supervised learning principles | Leo Breiman |
| 유형≠ | Ensemble (stacked generalization with unlabeled data augmentation) | 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, semi-supervised stacked generalization, self-trained stacking, semi-supervised meta-learning ensemble | bootstrap aggregating |
| 관련≠ | 5 | 4 |
| 요약≠ | Semi-supervised Stacking Ensemble extends the classic stacked generalization framework to settings where only a fraction of training examples carry labels. Base learners are first trained on labeled data, then used to assign pseudo-labels to unlabeled examples; the expanded dataset trains stronger base models whose out-of-fold predictions form the input to a meta-learner, yielding a two-tier ensemble that exploits both labeled and unlabeled structure. | 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데이터셋 ↗ |
|
|