|
Algorithm 2 Proposed FS Algorithm |
|
Input: original EEG feature set [1 × d] |
|
|
initialize |
▹ FPL to ones, rest randomly |
|
1 |
▹ pruning step counter |
|
0 |
▹ epochs between two pruning steps |
|
0 |
▹ all epochs during training |
|
|
while (d > ) OR () do
|
| if () OR () OR () then
|
▹ Perform pruning on the FPL |
|
|
| d← delete the weights in the FPL with the smallest magnitude |
| epochs ← 0 |
| n = n + 1 |
| train() |
|
, ← take the new k-sized feature subset and train the base network on it from scratch |