Porovnať metódy

	Aktívne učenie s gradientovým zosilňovaním	Aktívne učenie	Náhodný les
Odbor	Strojové učenie	Strojové učenie	Strojové učenie
Rodina	Machine learning	Machine learning	Machine learning
Rok vzniku	2000s–2010s	2009	2001
Tvorca	Settles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research community	Burr Settles	Breiman, L.
Typ	Active learning framework with gradient boosting base learner	Interactive supervised learning framework	Ensemble (bagging of decision trees)
Pôvodný zdroj	Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison.	Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Ďalšie názvy	AL-GBM, gradient boosting active learner, active gradient boosting, active learning with boosted trees	Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Príbuzné	4	2	4
Zhrnutie	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.	Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.	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.