手法を比較

	PatchTST	時系列予測のための conformal prediction	ランダムフォレスト
分野	深層学習	計量経済学	機械学習
系統	Machine learning	Regression model	Machine learning
提唱年	2023	2021	2001
提唱者	Nie, Y. et al.	Angelopoulos & Bates (tutorial); Xu & Xie (time-series EnbPI)	Breiman, L.
種類	Transformer for time series forecasting	Distribution-free prediction interval wrapper	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.	Angelopoulos, A. N. & Bates, S. (2023). Conformal Prediction: A Gentle Introduction. Foundations and Trends in Machine Learning, 16(4), 494-591.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
別名	PatchTST — Yama Tabanlı Zaman Serisi Transformer, patch-based time series transformer, channel-independent transformer	conformal prediction, distribution-free prediction intervals, EnbPI, Konformal Tahmin (Conformal Prediction — Zaman Serisi)	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連	3	4	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.	Conformal prediction is a distribution-free wrapper that turns any point forecaster — ARIMA, a neural network, or a machine-learning model — into valid prediction intervals using only its residuals. The time-series form was popularised by Xu & Xie (2021) and the modern tutorial treatment by Angelopoulos & Bates (2023).	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.