ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

Modelo ARIMA (Autoregressive Integrated Moving Average)×DeepAR×Random Forest×
CampoEconometríaAprendizaje profundoAprendizaje automático
FamiliaRegression modelMachine learningMachine learning
Año de origen201520202001
Autor originalBox & Jenkins (Box-Jenkins methodology)Salinas, D., Flunkert, V. & Gasthaus, J. (Amazon)Breiman, L.
TipoUnivariate time-series modelAutoregressive recurrent neural network (probabilistic forecasting)Ensemble (bagging of decision trees)
Fuente seminalBox, G. E. P., Jenkins, G. M., Reinsel, G. C. & Ljung, G. M. (2015). Time Series Analysis: Forecasting and Control (5th ed.). Wiley. ISBN: 978-1118675021Salinas, D., Flunkert, V., Gasthaus, J. & Januschowski, T. (2020). DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks. International Journal of Forecasting, 36(3), 1181–1191. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
AliasBox-Jenkins model, ARIMA(p,d,q), ARIMA ModeliDeepAR — Olasılıksal RNN Tahmini, probabilistic autoregressive RNN forecasting, Amazon DeepARRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Relacionados554
ResumenARIMA 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).DeepAR is Amazon's industrial forecasting model, introduced by Salinas, Flunkert and Gasthaus (2017; published 2020), that uses an autoregressive recurrent neural network to estimate the parameters of a probability distribution at each step, producing a confidence interval rather than a single point forecast. It can model many related time series jointly within one model.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateConjunto de datos
  1. v1
  2. 1 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: ARIMA · DeepAR · Random Forest. Recuperado el 2026-06-19 de https://scholargate.app/es/compare