Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms

Abstract : A common activity in many pattern recognition tasks, image processing or clustering techniques involves searching a labeled data set looking for the nearest point to a given unlabelled sample. To reduce the computational overhead when the naive exhaustive search is applied, some fast nearest neighbor search (NNS) algorithms have appeared in the last years. Depending on the structure used to store the training set (usually a tree), different strategies to speed up the search have been defined. In this paper, a new algorithm based on the combination of different pruning rules is proposed. An experimental evaluation and comparison of its behavior with respect to other techniques has been performed, using both real and artificial data.
Document type :
Conference papers
Complete list of metadatas

https://hal-ujm.archives-ouvertes.fr/hal-00961322
Contributor : Franck Thollard <>
Submitted on : Friday, September 10, 2010 - 3:47:50 PM
Last modification on : Tuesday, November 19, 2019 - 2:36:50 AM
Long-term archiving on: Thursday, June 30, 2011 - 1:26:28 PM

File

ssspr2010-combining-tabular-ru...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00961322, version 2

Citation

Eva Gómez-Ballester, Luisa Micó, Franck Thollard, Jose Oncina, Francisco Moreno-Seco. Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms. Structural, Syntactic, and Statistical Pattern Recognition, Aug 2010, Cesme, Izmir, Turkey. pp.80-89. ⟨hal-00961322v2⟩

Share

Metrics

Record views

496

Files downloads

314