ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Ενεργή Μάθηση με Ενίσχυση Κλίσης×Ενεργή Μάθηση×XGBoost×
ΠεδίοΜηχανική ΜάθησηΜηχανική ΜάθησηΜηχανική Μάθηση
ΟικογένειαMachine learningMachine learningMachine learning
Έτος προέλευσης2000s–2010s20092016
ΔημιουργόςSettles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research communityBurr SettlesChen, T. & Guestrin, C.
ΤύποςActive learning framework with gradient boosting base learnerInteractive supervised learning frameworkEnsemble (gradient-boosted decision trees)
Θεμελιώδης πηγήSettles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison. link ↗Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗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 treesQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeXGBoost, extreme gradient boosting, scalable tree boosting
Συναφείς425
Σύνοψη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.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.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. 1 Πηγές
  3. PUBLISHED
  1. v1
  2. 1 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Active Learning Gradient Boosting · Active Learning · XGBoost. Ανακτήθηκε στις 2026-06-17 από https://scholargate.app/el/compare