ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

Regresi Laini (ML)×Uimarishaji wa Mteremko×
NyanjaUjifunzaji wa MashineUjifunzaji wa Mashine
FamiliaMachine learningMachine learning
Mwaka wa asili1805–18092001
MwanzilishiLegendre, A.-M. & Gauss, C.F.Friedman, J. H.
AinaSupervised regressionEnsemble (sequential boosting of decision trees)
Chanzo asiliaHastie, T., Tibshirani, R. & Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction (2nd ed., Ch. 3). Springer. ISBN: 978-0-387-84858-7Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
Majina mbadalaordinary least squares regression, OLS, least squares regression, multiple linear regressionGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Zinazohusiana55
MuhtasariLinear regression fits a straight-line relationship between one or more input features and a continuous numeric outcome by minimising the sum of squared prediction errors. As a machine-learning model it is trained on labeled examples and evaluated on held-out data, making it the simplest supervised learning baseline for any regression task.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.
ScholarGateSeti ya data
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED
  1. v1
  2. 1 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Pakua slaidi

ScholarGateLinganisha mbinu: Linear Regression (ML) · Gradient Boosting. Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/compare