Details
Description
Currently, KNN algorithm makes a prediction using a linear scan of the date on each partition. It can take a long time in case we have a lot of data. Spatial indices such as KD tree and Ball tree can help to eliminate this problem by reducing asymptotic time to the logarithm.
Attachments
Issue Links
- links to