Pattern classification using an efficient KNNR

摘要

An efficient method is described to compute the K-nearest neighbour rule (KNNR). The number of distance computations is reduced considerably without any increase in the error rate. Unlike the other techniques, no preprocessing and approximation are involved in this technique which makes it suitable for overlapped classes.