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>, <doi:10.48550/arXiv.1603.09320>.
Version: | 1.0.3 |
Depends: | Matrix |
Imports: | Rcpp (≥ 1.0.4) |
LinkingTo: | Rcpp, RcppSpdlog, RcppEigen |
Suggests: | testthat |
Published: | 2024-02-26 |
DOI: | 10.32614/CRAN.package.N2R |
Author: | Peter Kharchenko [aut], Viktor Petukhov [aut], Dirk Eddelbuettel [ctb], Evan Biederstedt [cre, aut] |
Maintainer: | Evan Biederstedt <evan.biederstedt at gmail.com> |
BugReports: | https://github.com/kharchenkolab/N2R/issues |
License: | Apache License 2.0 |
Copyright: | see file COPYRIGHTS |
URL: | https://github.com/kharchenkolab/N2R |
NeedsCompilation: | yes |
Materials: | README |
CRAN checks: | N2R results |
Reference manual: | N2R.pdf |
Package source: | N2R_1.0.3.tar.gz |
Windows binaries: | r-devel: N2R_1.0.3.zip, r-release: N2R_1.0.3.zip, r-oldrel: N2R_1.0.3.zip |
macOS binaries: | r-release (arm64): N2R_1.0.3.tgz, r-oldrel (arm64): N2R_1.0.3.tgz, r-release (x86_64): N2R_1.0.3.tgz, r-oldrel (x86_64): N2R_1.0.3.tgz |
Old sources: | N2R archive |
Reverse imports: | conos, pagoda2 |
Please use the canonical form https://CRAN.R-project.org/package=N2R to link to this page.