ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

N-HiTS×PatchTST×Slučajna šuma×
PodručjeDuboko učenjeDuboko učenjeStrojno učenje
ObiteljMachine learningMachine learningMachine learning
Godina nastanka202320232001
TvoracChallu, C. et al.Nie, Y. et al.Breiman, L.
VrstaDeep neural forecasting (hierarchical interpolation)Transformer for time series forecastingEnsemble (bagging of decision trees)
Temeljni izvorChallu, C. et al. (2023). NHITS: Neural Hierarchical Interpolation for Time Series Forecasting. AAAI. DOI ↗Nie, Y., Nguyen, N. H., Sinthong, P. & Kalagnanam, J. (2023). A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. ICLR. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Drugi naziviN-HiTS — Hiyerarşik İnterpolasyon Tahmini, NHITS, Neural Hierarchical InterpolationPatchTST — Yama Tabanlı Zaman Serisi Transformer, patch-based time series transformer, channel-independent transformerRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Srodne334
SažetakN-HiTS (Neural Hierarchical Interpolation for Time Series Forecasting), introduced by Challu and colleagues in 2023, is a deep neural forecasting architecture that combines the hierarchical forecasts of multiple stacks operating at different sampling rates and merges them through interpolation. It extends N-BEATS to deliver markedly better accuracy on long forecast horizons.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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: N-HiTS · PatchTST · Random Forest. Preuzeto 2026-06-18 s https://scholargate.app/hr/compare