Extending Fast Nearest Neighbour Search Algorithms for Approximate κ-NN Classification

摘要

The nearest neighbour (NN) and κ-nearest neighbour (κ-NN) classification rules have been widely used in pattern recognition due to its simplicity and good behaviour, Exhaustive nearest neighbour search can become unpractical when facing large training sets, high dimensional data or expensive similarity measures. In the last years a lot of NN search algorithms have been developed to overcome those problems, and many of them are based on traversing a data structure (usually a tree) and selecting several candidates until the nearest neighbour is found. In this paper we propose a new classification rule that makes use of those selected (and usually discarded) prototypes. Several fast and widely known NN search algorithms have been extended with this rule obtaining classification results similar to those of a κ-NN classifier without extra computational overhead.