ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

시계열 예측을 위한 Conformal Prediction×ARIMA (Autoregressive Integrated Moving Average) 모형×그래디언트 부스팅×
분야계량경제학계량경제학머신러닝
계열Regression modelRegression modelMachine learning
기원 연도202120152001
창시자Angelopoulos & Bates (tutorial); Xu & Xie (time-series EnbPI)Box & Jenkins (Box-Jenkins methodology)Friedman, J. H.
유형Distribution-free prediction interval wrapperUnivariate time-series modelEnsemble (sequential boosting of decision trees)
원전Angelopoulos, A. N. & Bates, S. (2023). Conformal Prediction: A Gentle Introduction. Foundations and Trends in Machine Learning, 16(4), 494-591. DOI ↗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 ↗
별칭conformal prediction, distribution-free prediction intervals, EnbPI, Konformal Tahmin (Conformal Prediction — Zaman Serisi)Box-Jenkins model, ARIMA(p,d,q), ARIMA ModeliGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
관련455
요약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).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.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Conformal Prediction (Time Series) · ARIMA · Gradient Boosting. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare