Algorithm 3
Input : D t e s t 1 , L 1 , L 2
Output : L 2 τ
ξ ← using the Algorithm 2
q ← using the Algorithm 1
a ← ϕ
for i = 1 to n do
D t r a i n i ← add L 2 i to D t e s t 1
D t e s t ← selected k samples from D − D t e s t 1
a i ← utilizing SVM got a accuracy from D t r a i n i ∪ D t e s t
a ← a ∪ a i
end for
τ = arg max 1 ≤ i ≤ n a i
L 2 τ ← got the optional lable set