ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

تعزيز التدرج التعلم النشط×الغابات العشوائية×XGBoost×
المجالتعلم الآلةتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learningMachine learning
سنة النشأة2000s–2010s20012016
صاحب الطريقةSettles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research communityBreiman, L.Chen, T. & Guestrin, C.
النوعActive learning framework with gradient boosting base learnerEnsemble (bagging of decision trees)Ensemble (gradient-boosted 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 ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. 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 ensembleXGBoost, extreme gradient boosting, scalable tree boosting
ذات صلة445
الملخص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.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Active Learning Gradient Boosting · Random Forest · XGBoost. استُرجع بتاريخ 2026-06-17 من https://scholargate.app/ar/compare