Skip to main content
. 2022 May 9;22(9):3592. doi: 10.3390/s22093592
Algorithm 3 Dynamic Learning
Input:
  y: bandwidth slice, S: list of local smoothing algorithms, φi : hybrid smoothed LSTM algorithm, k: list of hybrid Smoothed LSTM algorithms (6 in this case),
  Output:
  δ: statistically significant smoothed LSTM algorithm, E: Forecast Error
  Process
  01: begin
  02: δ←∅;
  03: for all time steps tiϵ y  do
  04: Wj←Wj ∪ti;
  05: if Change is detected = true then//using Anderson–Darling
  06: Stop forecasting at Wj
  07: y^←  smooth y  in Wj+1 using algorithms in S
  //algorithm 3
  08: for φi ink
  09: φi ← Build new hybrid LSTM models (y^,ϑ)
  //algorithm 2
  10: E ← Calculate Forecast error of ti in Wj+2 using φi
  11: k←k∪ φi sorted with MinE
  12: δ←  Find in k the significant φi  with Min(E)
  13: If δ is significantly better than δi−1 //(old-Existed
 forecast algorithm) then
  14: replace  δi−1 by δ  else if
  15: keep δ
  16: endif
  17: endif
  18: Loop