ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Apprentissage actif avec LightGBM×Forêt Aléatoire×
DomaineApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learning
Année d'origine2017–present2001
Auteur d'origineSettles, B. (active learning); Ke, G. et al. (LightGBM)Breiman, L.
TypeHybrid (active learning query strategy + gradient boosting classifier)Ensemble (bagging of decision trees)
Source fondatriceSettles, 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 ↗
AliasAL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBMRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées54
Résumé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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Active Learning LightGBM · Random Forest. Consulté le 2026-06-17 sur https://scholargate.app/fr/compare