ScholarGate
アシスタント

手法を比較

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

アクティブラーニング線形回帰×ランダムフォレスト×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年19962001
提唱者Cohn, D. A.; Ghahramani, Z.; Jordan, M. I.Breiman, L.
種類Active learning / iterative supervised learningEnsemble (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-LR, active linear regression, query-based linear regression, optimal experimental design for regressionRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連24
概要Active Learning Linear Regression is an iterative machine-learning approach that couples a linear regression model with an intelligent query strategy to select the most informative unlabeled points for labeling. By focusing labeling effort where uncertainty is highest, it achieves competitive predictive accuracy with far fewer labeled examples than passive random sampling.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 Linear Regression · Random Forest. 2026-06-17に以下より取得 https://scholargate.app/ja/compare