Σύγκριση μεθόδων

	Ενεργή Μάθηση LightGBM	Τυχαίο Δάσος
Πεδίο	Μηχανική Μάθηση	Μηχανική Μάθηση
Οικογένεια	Machine learning	Machine learning
Έτος προέλευσης	2017–present	2001
Δημιουργός	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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Εναλλακτικές ονομασίες	AL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBM	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Συναφείς	5	4
Σύνοψη	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.