ScholarGate
دستیار

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

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

یادگیری فعال با تقویت گرادیان×جنگل تصادفی×
حوزهیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learning
سال پیدایش2000s–2010s2001
پدیدآورSettles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research communityBreiman, L.
نوعActive learning framework with gradient boosting base learnerEnsemble (bagging of decision trees)
منبع بنیادین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 ↗
نام‌های دیگرAL-GBM, gradient boosting active learner, active gradient boosting, active learning with boosted treesRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
مرتبط44
خلاصه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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

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

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