Anytime Interval-Valued Outputs for Kernel Machines: Fast Support Vector Machine Classification via Distance Geometry
Dennis DeCoste · 2002
Classifying M query examples using a support vector machine containing L support vectors traditionally requires exactly M * L kernel computations. We introduce a computational geometry method for which classification cost becomes roughly proportional to each query's difficulty (e.g. distance from the discriminant hyperplane). It produces exactly the same classifications, while typically requiring vastly fewer kernel computations.