Title :
An efficient searching algorithm for approximate nearest neighbor queries in high dimensions
Author :
Pramanik, Sakti ; Alexander, Scott ; Li, Jinhua
Author_Institution :
Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
Abstract :
We present an approximate nearest neighbor search algorithm that uses heuristics to decide whether or not to access a node in the index tree, based on three interesting data distribution properties. We demonstrate that the proposed algorithm significantly reduces the number of nodes accessed over the algorithms that have been proposed in earlier works. Also, it is demonstrated that the proposed algorithm can retain close to 100% of the K nearest neighbors in most cases
Keywords :
database indexing; query processing; search problems; tree data structures; trees (mathematics); very large databases; approximate nearest neighbor queries; data distribution properties; heuristics; index tree; node access; searching algorithm; Heuristic algorithms; Image databases; Image retrieval; Indexing; Information retrieval; Nearest neighbor searches; Neural networks; Partitioning algorithms; Pattern recognition; Tree data structures;
Conference_Titel :
Multimedia Computing and Systems, 1999. IEEE International Conference on
Conference_Location :
Florence
Print_ISBN :
0-7695-0253-9
DOI :
10.1109/MMCS.1999.779315
