Kernel and neighborhood methods · MLD-0596
KD-tree
A space-partitioning tree for efficient geometric search in favorable dimensions.
Original reference page · detailed expansion pending. Original definitions, examples, notes and citations are preserved below. New examples are illustrative, not benchmark results.
Original example
Accelerate low-dimensional nearest-neighbor queries.
Original caveat
Performance often degrades in high dimensions.
Context and aliases
Level: Intermediate. Stages: Theory · Training · Inference.
Tags: ML.
Aliases: K-dimensional tree.
Related concepts
Concepts linking here
Original references
- scikit-learn: nearest neighbors ↗ · Reference link
- scikit-learn: support vector machines ↗ · Reference link
- Original reference URL ↗