Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Модель ARIMA (авторегрессионная интегрированная скользящая средняя)× | PatchTST× | Случайный лес× | |
|---|---|---|---|
| Область≠ | Эконометрика | Глубокое обучение | Машинное обучение |
| Семейство≠ | Regression model | Machine learning | Machine learning |
| Год появления≠ | 2015 | 2023 | 2001 |
| Автор метода≠ | Box & Jenkins (Box-Jenkins methodology) | Nie, Y. et al. | Breiman, L. |
| Тип≠ | Univariate time-series model | Transformer for time series forecasting | 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 | Nie, Y., Nguyen, N. H., Sinthong, P. & Kalagnanam, J. (2023). A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. ICLR. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Другие названия≠ | Box-Jenkins model, ARIMA(p,d,q), ARIMA Modeli | PatchTST — Yama Tabanlı Zaman Serisi Transformer, patch-based time series transformer, channel-independent transformer | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Связанные≠ | 5 | 3 | 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). | PatchTST is a patch-based Transformer architecture for time series forecasting, introduced by Nie and colleagues in 2023, that cuts each series into overlapping patches treated as tokens and processes channels independently. It balances computational efficiency with strong accuracy on long-horizon forecasting. | 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Набор данных ↗ |
|
|
|