k-Nearest Neighbors (k-NN)

KD-Tree

Data structure that partitions k-dimensional space to accelerate nearest neighbor search, reducing complexity from O(n) to O(log n) on average.

← 뒤로