Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Модель ARIMA (авторегрессионная интегрированная скользящая средняя)× | Информер× | Случайный лес× | |
|---|---|---|---|
| Область≠ | Эконометрика | Глубокое обучение | Машинное обучение |
| Семейство≠ | Regression model | Machine learning | Machine learning |
| Год появления≠ | 2015 | 2021 | 2001 |
| Автор метода≠ | Box & Jenkins (Box-Jenkins methodology) | Zhou, H. et al. | Breiman, L. |
| Тип≠ | Univariate time-series model | Transformer (ProbSparse self-attention) | Ensemble (bagging of decision trees) |
| Основополагающий источник≠ | 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-1118675021 | Zhou, H. et al. (2021). Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting. AAAI. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Другие названия≠ | Box-Jenkins model, ARIMA(p,d,q), ARIMA Modeli | Informer — Uzun Dizi Transformer Tahmini, Informer transformer, ProbSparse attention forecaster | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Связанные≠ | 5 | 5 | 4 |
| Сводка≠ | 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). | Informer is a Transformer-based model introduced by Zhou et al. in 2021 for long-sequence time-series forecasting, using a ProbSparse self-attention mechanism that lowers the computational complexity of the standard Transformer to O(L log L). It is built for problems that demand predictions across thousands of future steps. | 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. |
| ScholarGateНабор данных ↗ |
|
|
|