Name
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 neighbor, for any data set and any query point, is directly related to a simple potential function that captures the difficulty of the point configuration. We then bound this potential function in several situations of interest: when the data are drawn from a doubling measure; when the data and query distributions are identical and are supported on a set of bounded doubling dimension; and when the data are documents from a topic model. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s00453-014-9885-5 | Algorithmica |
Keywords | Field | DocType |
Nearest neighbor,Intrinsic dimension,Spatial partition,k-d tree,Random projection | R-tree,Combinatorics,Fixed-radius near neighbors,Best bin first,Ball tree,Nearest neighbor graph,Large margin nearest neighbor,Cover tree,Nearest neighbor search,Mathematics | Journal |
Volume | Issue | ISSN |
72 | 1 | 0178-4617 |
Citations | PageRank | References |
22 | 0.90 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjoy Dasgupta | 1 | 2052 | 172.00 |
| Kaushik Sinha | 2 | 244 | 17.81 |