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. © 2013 Springer-Verlag.
CITATION STYLE
Houle, M. E., & Nett, M. (2013). Rank cover trees for nearest neighbor search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8199 LNCS, pp. 16–29). https://doi.org/10.1007/978-3-642-41062-8_3
Mendeley helps you to discover research relevant for your work.