Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification
نویسندگان
چکیده
The nearest neighbour (NN) and k-nearest neighbour (kNN) classi cation 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 classi cation 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 classi cation results similar to those of a k-NN classi er without extra computational overhead.
منابع مشابه
Some improvements on NN based classifiers in metric spaces
The nearest neighbour (NN) and k-nearest neighbour (k-NN) classification rules have been widely used in Pattern Recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search may become unpractical when facing large training sets, high dimensional data or expensive dissimilarity measures (distances). During the last years a lot of fast NN search algorithms have been d...
متن کاملExtending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours
Many pattern recognition tasks make use of the k nearest neighbour (k–NN) technique. In this paper we are interested on fast k– NN search algorithms that can work in any metric space i.e. they are not restricted to Euclidean–like distance functions. Only symmetric and triangle inequality properties are required for the distance. A large set of such fast k–NN search algorithms have been develope...
متن کاملApproximate Nearest Neighbour Search with the Fukunaga and Narendra Algorithm and Its Application to Chromosome Classification
The nearest neighbour (NN) rule is widely used in pattern recognition tasks due to its simplicity and its good behaviour. Many fast NN search algorithms have been developed during last years. However, in some classification tasks an exact NN search is too slow, and a way to quicken the search is required. To face these tasks it is possible to use approximate NN search, which usually increases e...
متن کاملThe design of a nearest-neighbor classifier and its use for Japanese character recognition
The nearest neighbor (NN) approach is a powerfd nonparametric technique for pattern classification tasks. In this paper, algorithms for prototype reduction, hierarchical prototype organization and fast NN search are described. To remove redundant category prototypes and to avoid redundant comparisons, the algorithms exploit geometrical information of a given prototype set which is represented a...
متن کاملImprovements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (closest k objects) to a query object. Although the definition of the distance between objects depends on applications, its computation is generally complicated and time-consuming. It is therefore important to reduce the...
متن کامل