Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Boosting× | Processus Gaussien× | |
|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1990–1997 | 2006 (book); roots in Kriging, 1951) |
| Auteur d'origine≠ | Schapire, R. E.; Freund, Y. | Rasmussen, C. E. & Williams, C. K. I. |
| Type≠ | Sequential ensemble (iterative reweighting) | Probabilistic non-parametric model |
| Source fondatrice≠ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 |
| Alias | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble | GP, Gaussian Process Regression, GPR, Kriging |
| Apparentées≠ | 6 | 3 |
| Résumé≠ | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. | 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 ↗ |
|
|