ScholarGate
アシスタント

手法を比較

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

アクティブラーニングLightGBM×ランダムフォレスト×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年2017–present2001
提唱者Settles, B. (active learning); Ke, G. et al. (LightGBM)Breiman, L.
種類Hybrid (active learning query strategy + gradient boosting classifier)Ensemble (bagging of decision trees)
原典Settles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(1), 1–114. Morgan & Claypool. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
別名AL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBMRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連54
概要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.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

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

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