ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

준지도 학습 부스팅×AdaBoost×그래디언트 부스팅×준지도 학습×
분야머신러닝머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learningMachine learning
기원 연도1999–2009199720011970s–2006 (formalized)
창시자Mallapragada, P. K.; Bennett, K. P.; and othersFreund, Y. & Schapire, R.E.Friedman, J. H.Vapnik, V. N. and others (community of researchers, 1970s–2000s)
유형Semi-supervised ensemble methodEnsemble (sequential boosting of weak learners)Ensemble (sequential boosting of decision trees)Learning paradigm
원전Mallapragada, P. K., Jin, R., Jain, A. K., & Liu, Y. (2009). SemiBoost: Boosting for Semi-supervised Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(11), 2000–2014. 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 ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
별칭SemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boostingAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineSSL, semi-supervised machine learning, transductive learning, label-efficient learning
관련5555
요약Semi-supervised Boosting is an ensemble learning paradigm that extends classical boosting algorithms — such as AdaBoost — to exploit both labeled and unlabeled data. By propagating label information through a similarity structure over unlabeled instances, it trains stronger classifiers than supervised boosting alone when labeled data are scarce.AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.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.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데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Semi-supervised Boosting · AdaBoost · Gradient Boosting · Semi-supervised Learning. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare