Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Modelo Aditivo Generalizado (GAM)× | Gradient Boosting× | |
|---|---|---|
| Campo | Aprendizaje automático | Aprendizaje automático |
| Familia | Machine learning | Machine learning |
| Año de origen≠ | 1986 | 2001 |
| Autor original≠ | Trevor Hastie & Robert Tibshirani | Friedman, J. H. |
| Tipo≠ | Semi-parametric additive regression model | Ensemble (sequential boosting of decision trees) |
| Fuente seminal≠ | Hastie, T., & Tibshirani, R. (1986). Generalized additive models. Statistical Science, 1(3), 297–310. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Alias | GAM, additive model, spline-based additive regression, Genelleştirilmiş toplamsal model | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| Relacionados≠ | 4 | 5 |
| Resumen≠ | A generalized additive model, introduced by Trevor Hastie and Robert Tibshirani in 1986, extends the generalized linear model by replacing each linear term with a smooth, data-driven function of the predictor. This lets the model capture nonlinear relationships while preserving the additive, term-by-term interpretability of regression: each predictor contributes its own estimated curve, and the curves simply add up (on a link scale) to predict the response. | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. |
| ScholarGateConjunto de datos ↗ |
|
|