Algorithm 2: Support vector machine (SVM)

Step

Processes involved

1

Start

2

Find candidate_SV with closest pair from classification (SV => support vector)

3

If there are violating points:

4

Find violating_points

5

Compute the candidate_SV= candidate_SV + voilating_points)

6

If there is any α_p < 0 due to the addition of c to S that gives negative:

7

Candidate_SV = candidate_SV

8

Repeat module to prune all data points

9

end_if

10

end_if