In this paper we show the results of a performance comparison between two Nearest Neighbour Search Methods: one, proposed by Arya & Mount, is based on a kd–tree data structure and a Branch and Bound approximate search algorithm 1, and the other is a search method based on dimensionality projections, presented by Nene & Nayar in 5. A number of experiments have been carried out in order to find the best choice to work with high dimensional points and large data sets.
ER -
%0 Journal Article
%1 javier2004comparison
%A Cano, Javier
%A Pérez-Cortés, Juan-Carlos
%A Salvador, Ismael
%D 2004
%J Structural, Syntactic, and Statistical Pattern Recognition
%K algorithm comparison nearest neighbor
%P 868--875
%T Comparison of Two Fast Nearest-Neighbour Search Methods in High-Dimensional Large-Sized Databases
%U http://www.springerlink.com/content/myxkgte9cf6y1pf3
%X In this paper we show the results of a performance comparison between two Nearest Neighbour Search Methods: one, proposed by Arya & Mount, is based on a kd–tree data structure and a Branch and Bound approximate search algorithm 1, and the other is a search method based on dimensionality projections, presented by Nene & Nayar in 5. A number of experiments have been carried out in order to find the best choice to work with high dimensional points and large data sets.
ER -
@article{javier2004comparison,
abstract = {In this paper we show the results of a performance comparison between two Nearest Neighbour Search Methods: one, proposed by Arya & Mount, is based on a kd–tree data structure and a Branch and Bound approximate search algorithm [1], and the other is a search method based on dimensionality projections, presented by Nene & Nayar in [5]. A number of experiments have been carried out in order to find the best choice to work with high dimensional points and large data sets.
ER -},
added-at = {2009-11-23T13:10:44.000+0100},
author = {Cano, Javier and Pérez-Cortés, Juan-Carlos and Salvador, Ismael},
biburl = {https://www.bibsonomy.org/bibtex/2ecf94f2d967959c89562bc0bae902727/folke},
description = {SpringerLink - Book Chapter},
interhash = {193afef04a1c331467653f020463e055},
intrahash = {ecf94f2d967959c89562bc0bae902727},
journal = {Structural, Syntactic, and Statistical Pattern Recognition},
keywords = {algorithm comparison nearest neighbor},
pages = {868--875},
timestamp = {2009-11-23T13:10:44.000+0100},
title = {Comparison of Two Fast Nearest-Neighbour Search Methods in High-Dimensional Large-Sized Databases},
url = {http://www.springerlink.com/content/myxkgte9cf6y1pf3},
year = 2004
}