ScholarGate
アシスタント

手法を比較

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

アクティブラーニングLightGBM×勾配ブースティング×LightGBM×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年2017–present20012017
提唱者Settles, B. (active learning); Ke, G. et al. (LightGBM)Friedman, J. H.Ke, G. et al. (Microsoft)
種類Hybrid (active learning query strategy + gradient boosting classifier)Ensemble (sequential boosting of decision trees)Gradient boosting decision tree ensemble
原典Settles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(1), 1–114. Morgan & Claypool. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗
別名AL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBMGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
関連555
概要Active Learning LightGBM couples the query-efficient label-selection strategy of active learning with the speed and accuracy of LightGBM, a histogram-based gradient boosting framework. The model iteratively selects the most informative unlabeled instances for human annotation, retrains LightGBM on the growing labeled set, and converges to high accuracy with far fewer labeled examples than passive supervised learning.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.LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

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

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