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, , .


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("N2R")

0.1.0 by Evan Biederstedt, a month ago


https://github.com/kharchenkolab/N2R


Report a bug at https://github.com/kharchenkolab/N2R/issues


Browse source code at https://github.com/cran/N2R


Authors: Peter Kharchenko [aut] , Viktor Petukhov [aut] , Dirk Eddelbuettel [ctb] , Evan Biederstedt [cre, aut]


Documentation:   PDF Manual  


Apache License 2.0 license


Imports Rcpp

Depends on Matrix

Suggests testthat

Linking to Rcpp, RcppSpdlog, RcppEigen

System requirements: GNU make


See at CRAN