เปรียบเทียบวิธี

	N-BEATS	DeepAR	Random Forest
สาขาวิชา	การเรียนรู้เชิงลึก	การเรียนรู้เชิงลึก	การเรียนรู้ของเครื่อง
ตระกูล	Machine learning	Machine learning	Machine learning
ปีกำเนิด	2020	2020	2001
ผู้ริเริ่ม	Oreshkin, B.N. et al.	Salinas, D., Flunkert, V. & Gasthaus, J. (Amazon)	Breiman, L.
ประเภท	Deep neural forecasting architecture (interpretable basis expansion)	Autoregressive recurrent neural network (probabilistic forecasting)	Ensemble (bagging of decision trees)
แหล่งต้นตำรับ	Oreshkin, B.N. et al. (2020). N-BEATS: Neural Basis Expansion Analysis for Interpretable Time Series Forecasting. ICLR.	Salinas, D., Flunkert, V., Gasthaus, J. & Januschowski, T. (2020). DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks. International Journal of Forecasting, 36(3), 1181–1191.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
ชื่อเรียกอื่น	N-BEATS — Nöral Zaman Serisi Tahmini, Neural Basis Expansion Analysis, neural basis expansion	DeepAR — Olasılıksal RNN Tahmini, probabilistic autoregressive RNN forecasting, Amazon DeepAR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
ที่เกี่ยวข้อง	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.	DeepAR is Amazon's industrial forecasting model, introduced by Salinas, Flunkert and Gasthaus (2017; published 2020), that uses an autoregressive recurrent neural network to estimate the parameters of a probability distribution at each step, producing a confidence interval rather than a single point forecast. It can model many related time series jointly within one model.	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.