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 2018/12/07 17:42:00 UTC
[jira] [Commented] (MADLIB-1061) Additional computation methods for
k-NN
[ https://issues.apache.org/jira/browse/MADLIB-1061?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16713123#comment-16713123 ]
Frank McQuillan commented on MADLIB-1061:
-----------------------------------------
Work is starting on K-D Tree as a next step
Run-time is O(D Nlog(N)) - better for large N, inefficient for large D
> 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
> Assignee: Orhan Kislal
> Priority: Major
> Labels: starter
> Fix For: v1.16
>
>
> 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.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)