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