Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount’s ANN library (v1.1.3). There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees.
This package implements nearest neighbors for the Euclidean (L2) metric. For the Manhattan (L1) metric, install theRANN1 package.
For further details on the underlying ANN library, seehttps://www.cs.umd.edu/~mount/ANN.
Installation
Released versions
The recommendation is to install the released version fromCRAN by doing:
install.packages("RANN")Feedback
Please feel free to:
- submit suggestions and bug-reports at:https://github.com/jefferislab/RANN/issues
- send pull requests after forking:https://github.com/jefferislab/RANN/
- e-mail the maintainer:jefferis@gmail.com
Copyright and License
seeinst/COPYRIGHT andDESCRIPTION files for copyright and license information.