So sánh phương pháp

	PatchTST	Rừng ngẫu nhiên
Lĩnh vực	Học sâu	Học máy
Họ	Machine learning	Machine learning
Năm ra đời	2023	2001
Người khởi xướng	Nie, Y. et al.	Breiman, L.
Loại	Transformer for time series forecasting	Ensemble (bagging of decision trees)
Công trình gốc	Nie, Y., Nguyen, N. H., Sinthong, P. & Kalagnanam, J. (2023). A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. ICLR.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Tên gọi khác	PatchTST — Yama Tabanlı Zaman Serisi Transformer, patch-based time series transformer, channel-independent transformer	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Liên quan	3	4
Tóm tắt	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.	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.