Speculate-Correct Error Bounds for k-Nearest Neighbor Classifiers

10/09/2014
by   Eric Bax, et al.
0

We introduce the speculate-correct method to derive error bounds for local classifiers. Using it, we show that k nearest neighbor classifiers, in spite of their famously fractured decision boundaries, have exponential error bounds with O(sqrt((k + ln n) / n)) error bound range for n in-sample examples.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset