When dimension d is at least polylogarithmic in n, k-d tree defeatist search returns the nearest neighbor with probability no better than random guessing and comprehensive search visits every cell with high probability.
org/stable/modules/generated/sklearn.neighbors.KDTree.html
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Performance bounds for nearest neighbor search with k-d trees
When dimension d is at least polylogarithmic in n, k-d tree defeatist search returns the nearest neighbor with probability no better than random guessing and comprehensive search visits every cell with high probability.