Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Aktiv inlärning med gradient boosting× | XGBoost× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2000s–2010s | 2016 |
| Upphovsperson≠ | Settles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research community | Chen, T. & Guestrin, C. |
| Typ≠ | Active learning framework with gradient boosting base learner | Ensemble (gradient-boosted decision trees) |
| Ursprungskälla≠ | Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison. link ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Alias≠ | AL-GBM, gradient boosting active learner, active gradient boosting, active learning with boosted trees | XGBoost, extreme gradient boosting, scalable tree boosting |
| Närliggande≠ | 4 | 5 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|