ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

半教師ありブースティング×AdaBoost×勾配ブースティング×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年1999–200919972001
提唱者Mallapragada, P. K.; Bennett, K. P.; and othersFreund, Y. & Schapire, R.E.Friedman, J. H.
種類Semi-supervised ensemble methodEnsemble (sequential boosting of weak learners)Ensemble (sequential boosting of decision trees)
原典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 ↗
別名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 machine
関連555
概要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.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Semi-supervised Boosting · AdaBoost · Gradient Boosting. 2026-06-18に以下より取得 https://scholargate.app/ja/compare