Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Proces Gaussian de Învățare Activă× | Proces Gaussian bayesian× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1992 | 1978–2006 |
| Autorul original≠ | MacKay, D. J. C. | O'Hagan, A.; Neal, R. M.; Rasmussen, C. E. & Williams, C. K. I. |
| Tip≠ | Bayesian active learning | Probabilistic kernel model |
| Sursa seminală≠ | MacKay, D. J. C. (1992). Information-based objective functions for active data selection. Neural Computation, 4(4), 590–604. DOI ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Denumiri alternative | GP active learning, Gaussian process active learning, GP-AL, Bayesian active learning with GP | GP regression, GPR, Gaussian process model, GP classifier |
| Înrudite≠ | 4 | 3 |
| 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. | A Bayesian Gaussian Process (GP) places a probability distribution directly over functions, using a kernel to encode similarity between inputs. After observing data, Bayes' rule converts this prior into a posterior that yields not just point predictions but calibrated uncertainty estimates at every new input — making it one of the most principled probabilistic models in machine learning. |
| ScholarGateSet de date ↗ |
|
|