Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Proces Gaussian de Învățare Activă× | Învățare activă× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1992 | 2009 |
| Autorul original≠ | MacKay, D. J. C. | Burr Settles |
| Tip≠ | Bayesian active learning | Interactive supervised learning framework |
| Sursa seminală≠ | MacKay, D. J. C. (1992). Information-based objective functions for active data selection. Neural Computation, 4(4), 590–604. DOI ↗ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ |
| Denumiri alternative | GP active learning, Gaussian process active learning, GP-AL, Bayesian active learning with GP | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme |
| Înrudite≠ | 4 | 2 |
| Rezumat≠ | Active Learning Gaussian Process (GP-AL) combines a Gaussian process probabilistic model with an active learning query strategy, using the GP's posterior uncertainty to select the most informative unlabeled examples for labeling. This iterative approach minimizes labeling effort while maximizing predictive accuracy, making it ideal when labeled data is scarce or expensive to obtain. | 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. |
| ScholarGateSet de date ↗ |
|
|