You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@madlib.apache.org by "Frank McQuillan (JIRA)" <ji...@apache.org> on 2017/02/01 00:12:51 UTC

[jira] [Updated] (MADLIB-1061) Additional computation methods for k-NN

     [ https://issues.apache.org/jira/browse/MADLIB-1061?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Frank McQuillan updated MADLIB-1061:
------------------------------------
    Description: 
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.


  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?




> Additional computation methods for k-NN
> ---------------------------------------
>
>                 Key: MADLIB-1061
>                 URL: https://issues.apache.org/jira/browse/MADLIB-1061
>             Project: Apache MADlib
>          Issue Type: Improvement
>          Components: k-NN
>            Reporter: Frank McQuillan
>             Fix For: v2.0
>
>
> 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.



--
This message was sent by Atlassian JIRA
(v6.3.15#6346)