Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Învățare activă× | Boosting× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2009 | 1990–1997 |
| Autorul original≠ | Burr Settles | Schapire, R. E.; Freund, Y. |
| Tip≠ | Interactive supervised learning framework | Sequential ensemble (iterative reweighting) |
| Sursa seminală≠ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| Denumiri alternative | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| Înrudite≠ | 2 | 6 |
| Rezumat≠ | 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. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGateSet de date ↗ |
|
|