Nothing
N2R: Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library
Implements methods to perform fast approximate K-nearest neighbor search on input matrix. Algorithm based on the 'N2' implementation of an approximate nearest neighbor search using hierarchical Navigable Small World (NSW) graphs. The original algorithm is described in "Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs", Y. Malkov and D. Yashunin, <doi:10.1109/TPAMI.2018.2889473>, <arXiv:1603.09320>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Peter Kharchenko [aut], Viktor Petukhov [aut], Dirk Eddelbuettel [ctb], Evan Biederstedt [cre, aut] |
| Maintainer | Evan Biederstedt <evan.biederstedt@gmail.com> |
| License | Apache License 2.0 |
| Version | 1.0.3 |
| URL | https://github.com/kharchenkolab/N2R |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the N2R package in your browser
Any scripts or data that you put into this service are public.
