ScholarGate
Asistenti

Krahasoni metodat

Shqyrtoni metodat e zgjedhura krah për krah; rreshtat që ndryshojnë janë të theksuar.

Mësimi aktiv×LightGBM×Pylli i Rastësishëm×
FushaMësimi i makinësMësimi i makinësMësimi i makinës
FamiljaMachine learningMachine learningMachine learning
Viti i origjinës200920172001
KrijuesiBurr SettlesKe, G. et al. (Microsoft)Breiman, L.
LlojiInteractive supervised learning frameworkGradient boosting decision tree ensembleEnsemble (bagging of decision trees)
Burimi themeluesSettles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Emërtime të tjeraQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boostingRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Të lidhura254
PërmbledhjaActive 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.LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.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.
ScholarGateSeti i të dhënave
  1. v1
  2. 1 Burimet
  3. PUBLISHED
  1. v1
  2. 1 Burimet
  3. PUBLISHED
  1. v1
  2. 2 Burimet
  3. PUBLISHED

Shko te kërkimi Shkarko diapozitivat

ScholarGateKrahasoni metodat: Active Learning · LightGBM · Random Forest. Marrë më 2026-06-18 nga https://scholargate.app/sq/compare