Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Modèle Bayésien de Mélange Gaussien× | Processus Gaussien× | |
|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1999–2006 | 2006 (book); roots in Kriging, 1951) |
| Auteur d'origine≠ | Attias, H.; Bishop, C. M. | Rasmussen, C. E. & Williams, C. K. I. |
| Type≠ | Probabilistic clustering / density estimation | Probabilistic non-parametric model |
| Source fondatrice≠ | Bishop, C. M. (2006). Pattern Recognition and Machine Learning (Ch. 10). Springer. ISBN: 978-0-387-31073-2 | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Alias | Bayesian GMM, Variational Gaussian Mixture, VBGMM, Dirichlet Process Gaussian Mixture | GP, Gaussian Process Regression, GPR, Kriging |
| Apparentées≠ | 4 | 3 |
| Résumé≠ | The Bayesian Gaussian Mixture Model places prior distributions over all mixture parameters and infers their posteriors — typically via Variational Bayes or MCMC — rather than fitting fixed point estimates. This yields principled uncertainty quantification, automatic selection of the effective number of components, and resistance to overfitting small datasets. | 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 ↗ |
|
|