Improved partial distance search for k nearest-neighbor classification

An important method in pattern recognition is k nearest-neighbor classification. However, its computational complexity limits its real-time applications. The partial distance search is a solution to this problem. Although it is not very effective, it can be combined with other algorithms to reduce the complexity. The paper proposes an indexing method that uses the variance vector of feature vectors of a design set to improve the efficiency of the partial distance search. Experimental results indicate the effectiveness of this indexing preprocessing