ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

یادگیری فعال LightGBM×جنگل تصادفی×
حوزهیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learning
سال پیدایش2017–present2001
پدیدآور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. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
نام‌های دیگرAL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBMRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
مرتبط54
خلاصه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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Active Learning LightGBM · Random Forest. بازیابی‌شده در 2026-06-17 از https://scholargate.app/fa/compare