Methoden vergleichen
Prüfen Sie die ausgewählten Methoden nebeneinander; abweichende Zeilen sind hervorgehoben.
| Gradient-Boosting mit aktivem Lernen× | Random Forest× | |
|---|---|---|
| Fachgebiet | Maschinelles Lernen | Maschinelles Lernen |
| Familie | Machine learning | Machine learning |
| Entstehungsjahr≠ | 2000s–2010s | 2001 |
| Urheber≠ | Settles, B. (active learning); Friedman, J. H. (gradient boosting); combined framework developed by the research community | Breiman, L. |
| Typ≠ | Active learning framework with gradient boosting base learner | Ensemble (bagging of decision trees) |
| Wegweisende Quelle≠ | 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 ↗ |
| Aliasnamen | AL-GBM, gradient boosting active learner, active gradient boosting, active learning with boosted trees | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Verwandt | 4 | 4 |
| Zusammenfassung≠ | 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. |
| ScholarGateDatensatz ↗ |
|
|