Details
-
New Feature
-
Status: Resolved
-
Minor
-
Resolution: Won't Fix
-
None
-
None
Description
After tackling the general k-Nearest Neighbor model as per https://issues.apache.org/jira/browse/SPARK-2335 , there's an opportunity to also offer approximate k-Nearest Neighbor. A promising approach would involve building a kd-tree variant within from each partition, a la
http://www.autonlab.org/autonweb/14714.html?branch=1&language=2
This could offer a simple non-linear ML model that can label new data with much lower latency than the plain-vanilla kNN versions.
Attachments
Issue Links
- depends upon
-
SPARK-2335 k-Nearest Neighbor classification and regression for MLLib
- Resolved
- is duplicated by
-
SPARK-2335 k-Nearest Neighbor classification and regression for MLLib
- Resolved