ScholarGate
المساعد

قارن الطرق

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

التعلم النشط×الغابات العشوائية×XGBoost×
المجالتعلم الآلةتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learningMachine learning
سنة النشأة200920012016
صاحب الطريقةBurr SettlesBreiman, L.Chen, T. & Guestrin, C.
النوعInteractive supervised learning frameworkEnsemble (bagging of decision trees)Ensemble (gradient-boosted decision trees)
المصدر التأسيسيSettles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. 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 ↗
الأسماء البديلةQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleXGBoost, extreme gradient boosting, scalable tree boosting
ذات صلة245
الملخصActive 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.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. 1 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED

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

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