ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Model Aditif Generalized (GAM)×Peningkatan Cerun×
BidangPembelajaran MesinPembelajaran Mesin
KeluargaMachine learningMachine learning
Tahun asal19862001
PengasasTrevor Hastie & Robert TibshiraniFriedman, J. H.
JenisSemi-parametric additive regression modelEnsemble (sequential boosting of decision trees)
Sumber perintisHastie, 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 ↗
AliasGAM, additive model, spline-based additive regression, Genelleştirilmiş toplamsal modelGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Berkaitan45
RingkasanA 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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Generalized Additive Model · Gradient Boosting. Dicapai 2026-06-18 daripada https://scholargate.app/ms/compare