Rank Cover Trees For Nearest Neighbor Search
SISAP 2013: Proceedings of the 6th International Conference on Similarity Search and Applications - Volume 8199(2013)
摘要
This paper introduces a k-NN search index, the Rank Cover Tree (RCT), whose pruning tests rely solely on the comparison of similarity values; other properties of the underlying space, such as the triangle inequality, are not employed. A formal theoretical analysis shows that with very high probability, the RCT returns a correct query result in time that depends competitively on a measure of the intrinsic dimensionality of the data set. Experiments show that the RCT is capable of meeting or exceeding the level of performance of state-of-the-art methods that make use of metric pruning or selection tests involving numerical constraints on distance values.
更多查看译文
关键词
Similarity Search, Query Point, Coverage Parameter, Golden Ratio, Execution Cost
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络