[
https://issues.apache.org/jira/browse/FLINK-1745?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14740076#comment-14740076
]
Daniel Blazevski edited comment on FLINK-1745 at 9/11/15 3:07 AM:
------------------------------------------------------------------
In fact, if what [~chiwanpark] has is thought to be a good base for a kNN
algorithm, one option could be that I help to make it more efficient by
modifying what he has and incorporate an R-tree (
https://en.wikipedia.org/wiki/R-tree ) ?
was (Author: danielblazevski):
In fact, if what [~chiwanpark] has is thought to be a good base for a kNN
algorithm, one option could be that I help to make it more efficient by
modifying what he has and incorporate an R-tree
(https://en.wikipedia.org/wiki/R-tree)?
> Add exact k-nearest-neighbours algorithm to machine learning library
> --------------------------------------------------------------------
>
> Key: FLINK-1745
> URL: https://issues.apache.org/jira/browse/FLINK-1745
> Project: Flink
> Issue Type: New Feature
> Components: Machine Learning Library
> Reporter: Till Rohrmann
> Labels: ML, Starter
>
> Even though the k-nearest-neighbours (kNN) [1,2] algorithm is quite trivial
> it is still used as a mean to classify data and to do regression. This issue
> focuses on the implementation of an exact kNN (H-BNLJ, H-BRJ) algorithm as
> proposed in [2].
> Could be a starter task.
> Resources:
> [1] [http://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm]
> [2] [https://www.cs.utah.edu/~lifeifei/papers/mrknnj.pdf]
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
