Table 8 Algorithm for SVM subset selection
1 | Let M = {SVM1, SVM2, ..., SVMN} be the set of candidate SVMs |
|---|---|
2 | Let Scoremax = V(S, M) and Setmax = M |
3 | FOR i = N-1 to 1 |
   4 | Vmax = max{V(S, M - {SVMr}) | SVMr ∈ M, 1 ≤ r ≤ N } |
   5 | IF V(S, M - {SVMj}) == Vmax (1 ≤ j ≤ N) THEN |
6 | M = M - {SVMj} |
   7 | ENDIF |
   8 | IF Vmax ≥ Scoremax THEN |
9 | Scoremax = Vmax |
10 | Setmax = M |
   11 | ENDIF |
12 | END FOR |