手法を比較

	PatchTST	ARIMA（自己回帰和分移動平均）モデル	ランダムフォレスト
分野	深層学習	計量経済学	機械学習
系統	Machine learning	Regression model	Machine learning
提唱年	2023	2015	2001
提唱者	Nie, Y. et al.	Box & Jenkins (Box-Jenkins methodology)	Breiman, L.
種類	Transformer for time series forecasting	Univariate time-series model	Ensemble (bagging of decision trees)
原典	Nie, Y., Nguyen, N. H., Sinthong, P. & Kalagnanam, J. (2023). A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. ICLR.	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.
別名	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
関連	3	5	4
概要	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.