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>.
copied from cf-staging / r-n2r
https://anaconda.org/conda-forge/r-n2r/badges/version.svg
https://anaconda.org/conda-forge/r-n2r/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-n2r/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-n2r/badges/platforms.svg
https://anaconda.org/conda-forge/r-n2r/badges/license.svg
https://anaconda.org/conda-forge/r-n2r/badges/downloads.svg