ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

Aktív Tanulás Gradient Boosting×Véletlen erdő×
TudományterületGépi tanulásGépi tanulás
MódszercsaládMachine learningMachine learning
Keletkezés éve2000s–2010s2001
MegalkotóSettles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research communityBreiman, L.
TípusActive learning framework with gradient boosting base learnerEnsemble (bagging of decision trees)
AlapműSettles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Alternatív nevekAL-GBM, gradient boosting active learner, active gradient boosting, active learning with boosted treesRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Kapcsolódó44
ÖsszefoglalóActive Learning Gradient Boosting combines the powerful predictive accuracy of gradient boosted trees with an active learning loop that selects the most informative unlabeled examples for human annotation. By querying only the instances the model is most uncertain about, the method achieves 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.
ScholarGateAdatkészlet
  1. v1
  2. 2 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: Active Learning Gradient Boosting · Random Forest. Letöltve 2026-06-17, forrás: https://scholargate.app/hu/compare