ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

חיזוי קונפורמי לסדרות עתיות×גרדיאנט בוסטינג×רגרסיית ריבועים פחותים רגילים (OLS)×רגרסיית קוונטילים×
תחוםאקונומטריקהלמידת מכונהאקונומטריקהאקונומטריקה
משפחהRegression modelMachine learningRegression modelRegression model
שנת המקור2021200120191978
הוגה השיטהAngelopoulos & Bates (tutorial); Xu & Xie (time-series EnbPI)Friedman, J. H.Wooldridge (textbook treatment); classical least squaresKoenker & Bassett
סוגDistribution-free prediction interval wrapperEnsemble (sequential boosting of decision trees)Linear regressionConditional quantile regression
מקור מכונןAngelopoulos, A. N. & Bates, S. (2023). Conformal Prediction: A Gentle Introduction. Foundations and Trends in Machine Learning, 16(4), 494-591. DOI ↗Friedman, 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 ↗
כינוייםconformal prediction, distribution-free prediction intervals, EnbPI, Konformal Tahmin (Conformal Prediction — Zaman Serisi)Gradient 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
קשורות4555
תקצירConformal prediction is a distribution-free wrapper that turns any point forecaster — ARIMA, a neural network, or a machine-learning model — into valid prediction intervals using only its residuals. The time-series form was popularised by Xu & Xie (2021) and the modern tutorial treatment by Angelopoulos & Bates (2023).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.
ScholarGateמערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Conformal Prediction (Time Series) · Gradient Boosting · OLS Regression · Quantile Regression. אוחזר בתאריך 2026-06-18 מתוך https://scholargate.app/he/compare