방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 그래디언트 부스팅× | 레이블 전파× | 준지도 학습× | |
|---|---|---|---|
| 분야 | 머신러닝 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning | Machine learning |
| 기원 연도≠ | 2001 | 2002 | 1970s–2006 (formalized) |
| 창시자≠ | Friedman, J. H. | Zhu, X. & Ghahramani, Z. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| 유형≠ | Ensemble (sequential boosting of decision trees) | Graph-based semi-supervised classification | Learning paradigm |
| 원전≠ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| 별칭 | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LP, label spreading, graph-based semi-supervised learning, harmonic label propagation | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| 관련≠ | 5 | 3 | 5 |
| 요약≠ | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. | Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data. | 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데이터셋 ↗ |
|
|
|