An alternative method picks the example with the smallest margin: the difference between the largest two values in the vector q (Abe and Mamitsuka, 1998).
if c and ' c are the two most likely categories for example n x , the margin is measured as follows: In this case Algorithm 1 would rank examples by increasing values of margin, with the smallest value at the top of the ranking.