Randomized Partition Trees for Nearest Neighbor Search

Abstract

The $$k$$ k -d tree was one of the first spatial data structures proposed for nearest neighbor search. Its efficacy is diminished in high-dimensional spaces, but several variants, with randomization and overlapping cells, have proved to be successful in practice. We analyze three such schemes. We show that the probability that they fail to find the nearest… (More)
DOI: 10.1007/s00453-014-9885-5

3 Figures and Tables

Topics

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 13

Averaging 13 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics