Skip to main content
. 2020 Dec 26;21(1):106. doi: 10.3390/s21010106
Algorithm 2: Sub-task Information Generator.
Input: a sequence of modified class labels Dr={c´jr|j=1,2,…,ns}, window size ws, sliding samples ss
Output: a sequence of sub-task labels Dg={c´ig|i=1,2,…,ng}
1: Begin
2:   initialize i ←1
3:   for j=1 to ns−1 do //for the first ns−1 modified class labels
4:    while  i≤(j×ss)
5:     c´ig←c´jr
6:     Dg←c´ig
7:     i←i+1
8:    endwhile
9:  endfor
10:  for i to i+ws do //for the last ns modified class labels
11:     c´ig←c´nsr
12:     Dg←c´ig
13:  endfor
14: End