방법 비교

	N-BEATS	ARIMA (Autoregressive Integrated Moving Average) 모형	Informer	랜덤 포레스트
분야	딥러닝	계량경제학	딥러닝	머신러닝
계열	Machine learning	Regression model	Machine learning	Machine learning
기원 연도	2020	2015	2021	2001
창시자	Oreshkin, B.N. et al.	Box & Jenkins (Box-Jenkins methodology)	Zhou, H. et al.	Breiman, L.
유형	Deep neural forecasting architecture (interpretable basis expansion)	Univariate time-series model	Transformer (ProbSparse self-attention)	Ensemble (bagging of decision trees)
원전	Oreshkin, B.N. et al. (2020). N-BEATS: Neural Basis Expansion Analysis for Interpretable Time Series Forecasting. 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	Zhou, H. et al. (2021). Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting. AAAI.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	N-BEATS — Nöral Zaman Serisi Tahmini, Neural Basis Expansion Analysis, neural basis expansion	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	5	4
요약	N-BEATS is a deep learning architecture for time series forecasting, introduced by Oreshkin and colleagues in 2020, built from interpretable trend and seasonality stacks. It was the first purely neural forecasting model to reach state-of-the-art performance on the M4 competition without relying on any classical statistical components.	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.