ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

ARIMA (Autoregressive Integrated Moving Average) modell×Gradient Boosting×Regresszió Ordináris Legkisebb Négyzetes (OLS) módszerrel×Kvantilis regresszió×
TudományterületÖkonometriaGépi tanulásÖkonometriaÖkonometria
MódszercsaládRegression modelMachine learningRegression modelRegression model
Keletkezés éve2015200120191978
MegalkotóBox & Jenkins (Box-Jenkins methodology)Friedman, J. H.Wooldridge (textbook treatment); classical least squaresKoenker & Bassett
TípusUnivariate time-series modelEnsemble (sequential boosting of decision trees)Linear regressionConditional quantile regression
AlapműBox, G. E. P., Jenkins, G. M., Reinsel, G. C. & Ljung, G. M. (2015). Time Series Analysis: Forecasting and Control (5th ed.). Wiley. ISBN: 978-1118675021Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Wooldridge, J. M. (2019). Introductory Econometrics: A Modern Approach (7th ed.). Cengage Learning. ISBN: 978-1337558860Koenker, R. & Bassett, G., Jr. (1978). Regression Quantiles. Econometrica, 46(1), 33-50. DOI ↗
Alternatív nevekBox-Jenkins model, ARIMA(p,d,q), ARIMA ModeliGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineordinary least squares, classical linear regression, linear regression, en küçük kareler regresyonuconditional quantile regression, regression quantiles, Kantil Regresyon
Kapcsolódó5555
ÖsszefoglalóARIMA is a univariate time-series forecasting model that combines autoregressive, integrated (differencing), and moving-average components to predict a single continuous series from its own past. It is the centrepiece of the Box-Jenkins methodology set out in Box, Jenkins, Reinsel & Ljung's Time Series Analysis (5th ed., 2015).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.Ordinary Least Squares is the classical linear regression method that explains a continuous outcome as a linear combination of predictors. It estimates the coefficients by minimising the sum of squared residuals, and under the Gauss-Markov assumptions these estimates are the best linear unbiased estimator (BLUE).Quantile regression models conditional quantiles of an outcome - the median, the 25th or 75th percentile, and so on - rather than the conditional mean that OLS targets. Introduced by Koenker and Bassett in 1978, it reveals how predictors act across the whole distribution, including its tails.
ScholarGateAdatkészlet
  1. v1
  2. 1 Források
  3. PUBLISHED
  1. v1
  2. 1 Források
  3. PUBLISHED
  1. v1
  2. 1 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: ARIMA · Gradient Boosting · OLS Regression · Quantile Regression. Letöltve 2026-06-19, forrás: https://scholargate.app/hu/compare