An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions
Multimedia Computing and Systems, 1999. IEEE International Conference（1999）
摘要
In this paper, we present an approximate nearest neighbor search algorithm that use 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 will be demonstrated in this paper that the proposed algorithm can retain close to 100% of the K nearest neighbors in most cases.
更多查看译文
关键词
high dimensions,efficient searching algorithm,use heuristics,index tree,approximate nearest neighbor search,earlier work,approximate nearest neighbor queries,interesting data distribution property,proposed algorithm,neural networks,indexation,heuristics,search algorithm,tree data structures,information retrieval,k nearest neighbor,pattern recognition,database indexing,image retrieval,searching algorithm,indexing
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要