Comparison of Two Fast Nearest-Neighbour Search Methods in High-Dimensional Large-Sized Databases
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 , and the other is a search method based on dimensionality projections, presented by Nene & Nayar in . 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.
KeywordsTest Point Query Point Candidate List Rank Number Tree Data Structure
- 5.Nene, S.A., Nayar, S.K.: A simple algorithm for nearest neighbor search in high dimensions. IEEETPAMI: IEEE Transactions on Pattern Analysis and Machine Intelligence 19 (1997)Google Scholar