Sciweavers

Share
IBPRIA
2007
Springer

A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms

9 years 1 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store the training set, different strategies to speed up the search have been defined. For instance, pruning rules avoid the search of some branches of a tree in a tree-based search algorithm. In this paper, we propose a new and simple pruning rule that can be used in most of the tree-based search algorithms. All the information needed by the rule can be stored in a table (at preprocessing time). Moreover, the rule can be computed in constant time. This approach is evaluated through real and artificial data experiments. In order to test its performance, the rule is compared to and combined with other previously defined rules.
José Oncina, Franck Thollard, Eva Gó
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where IBPRIA
Authors José Oncina, Franck Thollard, Eva Gómez-Ballester, Luisa Micó, Francisco Moreno-Seco
Comments (0)
books