Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Processus Gaussien d'Ensemble× | Processus Gaussien× | |
|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 2000–2015 | 2006 (book); roots in Kriging, 1951) |
| Auteur d'origine≠ | Tresp, V. (committee formulation); Deisenroth, M. P. & Ng, J. W. (distributed formulation) | Rasmussen, C. E. & Williams, C. K. I. |
| Type≠ | Ensemble of probabilistic surrogate models | Probabilistic non-parametric model |
| Source fondatrice≠ | 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 |
| Alias | Gaussian Process ensemble, GP committee machine, distributed GP, mixture of GPs | GP, Gaussian Process Regression, GPR, Kriging |
| Apparentées≠ | 4 | 3 |
| Résumé≠ | 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 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. |
| ScholarGateJeu de données ↗ |
|
|