방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 부스팅× | 준지도 학습× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1990–1997 | 1970s–2006 (formalized) |
| 창시자≠ | Schapire, R. E.; Freund, Y. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| 유형≠ | Sequential ensemble (iterative reweighting) | Learning paradigm |
| 원전≠ | 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 ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| 별칭 | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| 관련≠ | 6 | 5 |
| 요약≠ | 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. | Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained. |
| ScholarGate데이터셋 ↗ |
|
|