Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Proces Gaussian de Ansamblu× | Proces Gaussian bayesian× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2000–2015 | 1978–2006 |
| Autorul original≠ | Tresp, V. (committee formulation); Deisenroth, M. P. & Ng, J. W. (distributed formulation) | O'Hagan, A.; Neal, R. M.; Rasmussen, C. E. & Williams, C. K. I. |
| Tip≠ | Ensemble of probabilistic surrogate models | Probabilistic kernel model |
| Sursa seminală≠ | Tresp, V. (2000). A Bayesian Committee Machine. Neural Computation, 12(11), 2719–2741. DOI ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Denumiri alternative | Gaussian Process ensemble, GP committee machine, distributed GP, mixture of GPs | GP regression, GPR, Gaussian process model, GP classifier |
| Înrudite≠ | 4 | 3 |
| Rezumat≠ | Ensemble Gaussian Process trains multiple independent GP experts on data subsets or overlapping regions, then combines their posterior predictions — means and variances — into a single probabilistic forecast. This approach retains the calibrated uncertainty estimates of standard GPs while overcoming their O(n³) cubic cost bottleneck, making probabilistic regression practical on datasets with thousands to millions of observations. | 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 ↗ |
|
|