[
https://issues.apache.org/jira/browse/FLINK-1745?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14739730#comment-14739730
]
Daniel Blazevski commented on FLINK-1745:
-----------------------------------------
Hello,
I recently posted about contributing to an approximate kNN algorithm.
I am also curious about the status on the exact kNN algorithm, would be happy
to help build an algorithm that scales to TB of data using lots of nodes, and
maybe even using R-trees -- eventually should use R-trees, but may or may not
be good to implement one on a first trial.
I've been reading Reference [2] recently to get more ideas to potentially
define a scope for a contribution.
> 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)
