Skip to main content
. 2010 Jun 8;4(3):207–216. doi: 10.1007/s11571-010-9114-0
Algorithm 2 Summary of frequency band selection algorithm
Define:  [1] Data vector construction function: FV(X(j), Qi) consisting the operations of constructing new data set by removing the EEG signals of those channels not in Qi.
      [2] Iteration stopping criterion: the normalized difference between labels predicted in two successive iterations being less than a predefined threshold δ2.
Input:  the training set Inline graphic and their corresponding labels Inline graphicthe test set Inline graphicfrequency sub-bands Inline graphic threshold δ1 for stopping the iterations
iter = 0
Fori = 1 to nf
  Xi(k) = BF(X(k)), Fi, where Inline graphic.
  Inline graphic, where Inline graphic and Inline graphic is a transformation matrix, which is  composed by the first and last three columns of CSP spatial transformation matrix.
  Inline graphic SVMtrainInline graphic by solving Eq. 8
  Fork = Nc + 1 to Nc + Nt
     Inline graphic
  end
end
Repeat
  iter = iter + 1
  Fori = 1 to nf
    Ifi =  = 1
     with Inline graphic and Inline graphic,
       obtain Inline graphic by Eq. 5
    Else
     with Inline graphic and Inline graphic,
       obtain Inline graphic by Eq. 5
    End
  End
  Inline graphic
  corresponding predicted labels Inline graphic
  Inline graphic for k = 1 to Nc + Nt
  Inline graphic where Inline graphic and Inline graphic is a transformation matrix, which is composed by the first and last three columns of CSP spatial transformation matrix based on Inline graphic
  Inline graphic SVMtrain Inline graphic by solving Eq. 8, where yk, Inline graphic are the labels predicted in the previous iteration.
  Fork = Nc + 1~to~Nc + Nt
      Inline graphic
  end
Until stopping criterion satisfied
Output: the frequency sub-band F(s) and the corresponding labels Inline graphic