Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| PatchTST× | Modelul ARIMA (Autoregresiv Integrat cu Medii Mobile)× | Pădurea Aleatoare (Random Forest)× | |
|---|---|---|---|
| Domeniu≠ | Învățare profundă | Econometrie | Învățare automată |
| Familie≠ | Machine learning | Regression model | Machine learning |
| Anul apariției≠ | 2023 | 2015 | 2001 |
| Autorul original≠ | Nie, Y. et al. | Box & Jenkins (Box-Jenkins methodology) | Breiman, L. |
| Tip≠ | Transformer for time series forecasting | Univariate time-series model | Ensemble (bagging of decision trees) |
| Sursa seminală≠ | Nie, Y., Nguyen, N. H., Sinthong, P. & Kalagnanam, J. (2023). A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. ICLR. link ↗ | 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 | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Denumiri alternative≠ | PatchTST — Yama Tabanlı Zaman Serisi Transformer, patch-based time series transformer, channel-independent transformer | Box-Jenkins model, ARIMA(p,d,q), ARIMA Modeli | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Înrudite≠ | 3 | 5 | 4 |
| Rezumat≠ | 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. | 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). | 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. |
| ScholarGateSet de date ↗ |
|
|
|