Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Boosting× | Proces Gaussian× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1990–1997 | 2006 (book); roots in Kriging, 1951) |
| Autorul original≠ | Schapire, R. E.; Freund, Y. | Rasmussen, C. E. & Williams, C. K. I. |
| Tip≠ | Sequential ensemble (iterative reweighting) | Probabilistic non-parametric model |
| Sursa seminală≠ | 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 |
| Denumiri alternative | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble | GP, Gaussian Process Regression, GPR, Kriging |
| Înrudite≠ | 6 | 3 |
| Rezumat≠ | 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. |
| ScholarGateSet de date ↗ |
|
|