[
https://issues.apache.org/jira/browse/MADLIB-1129?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Frank McQuillan updated MADLIB-1129:
------------------------------------
Description:
Follow on to
https://issues.apache.org/jira/browse/MADLIB-927
List the k-nearest neighbors used in the voting/averaging. This could be added
was:
Follow on to
https://issues.apache.org/jira/browse/MADLIB-927
which uses brute force.
Determine other k-NN algos to implement. From
http://scikit-learn.org/stable/modules/neighbors.html
candidates are:
* K-D Tree
* Ball Tree
* Other?
Look at how to implement in a distributed way. Also may want to revisit
current brute force approach to see if there are improvements to make on
parallelism - testing is in serial currently.
> Additional output for k-NN
> --------------------------
>
> Key: MADLIB-1129
> URL: https://issues.apache.org/jira/browse/MADLIB-1129
> Project: Apache MADlib
> Issue Type: Improvement
> Components: k-NN
> Reporter: Frank McQuillan
> Priority: Minor
> Labels: starter
> Fix For: v2.0
>
>
> Follow on to
> https://issues.apache.org/jira/browse/MADLIB-927
> List the k-nearest neighbors used in the voting/averaging. This could be
> added
--
This message was sent by Atlassian JIRA
(v6.4.14#64029)
