Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Gaussisk process× | Bayesiansk Gaussisk Process× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2006 (book); roots in Kriging, 1951) | 1978–2006 |
| Upphovsperson≠ | Rasmussen, C. E. & Williams, C. K. I. | O'Hagan, A.; Neal, R. M.; Rasmussen, C. E. & Williams, C. K. I. |
| Typ≠ | Probabilistic non-parametric model | Probabilistic kernel model |
| Ursprungskälla | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Alias | GP, Gaussian Process Regression, GPR, Kriging | GP regression, GPR, Gaussian process model, GP classifier |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | A Gaussian Process (GP) is a non-parametric, fully probabilistic machine learning model that places a prior distribution directly over functions. Rather than predicting a single value, it returns a predictive mean and a calibrated uncertainty estimate at every test point, making it especially valuable for regression on small to medium datasets and for Bayesian optimization tasks. | 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. |
| ScholarGateDatamängd ↗ |
|
|