Algorithm 2.
Rs ← {}; M0 ← InitClassifier(Rs) |
while DoSearch() do |
e+ ← RandomSeed(); |
⊥e+ ← saturate(e+); |
ce+ ← ⊤; Me+ ← M0; |
while c ← reduce(⊥e+) do |
M ← LearnClassifier(Rs ∪ {c}); |
if Better(M, Me) then |
ce+ ← c; Me+ ← M; |
end if |
end while |
if ce+ ≠ ⊤ then |
Rs ← Rs ∪ {ce+}; M0 ← Me+; |
end if |
end while |