Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Активне навчання на Гауссових процесах× | Напівкерований Гаусівський процес× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1992 | 2004 |
| Автор методу≠ | MacKay, D. J. C. | Lawrence, N. D. & Jordan, M. I. |
| Тип≠ | Bayesian active learning | Probabilistic model (semi-supervised) |
| Основоположне джерело≠ | MacKay, D. J. C. (1992). Information-based objective functions for active data selection. Neural Computation, 4(4), 590–604. DOI ↗ | Lawrence, N. D., & Jordan, M. I. (2004). Semi-supervised learning via Gaussian processes. In Advances in Neural Information Processing Systems (NIPS), 17, 753–760. MIT Press. link ↗ |
| Інші назви | GP active learning, Gaussian process active learning, GP-AL, Bayesian active learning with GP | SS-GP, semi-supervised GP, Gaussian process with unlabeled data, GP manifold learning |
| Пов'язані≠ | 4 | 5 |
| Підсумок≠ | 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. | Semi-supervised Gaussian Process extends the probabilistic GP framework to exploit unlabeled data alongside a small set of labeled observations. By placing a GP prior over functions and leveraging the geometric structure revealed by unlabeled inputs, it learns more accurate and better-calibrated predictors than a purely supervised GP when labels are scarce, making it well suited for scientific and medical problems where annotation is expensive. |
| ScholarGateНабір даних ↗ |
|
|