N2R (Q93224)

From MaRDI portal
Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library
Language Label Description Also known as
English
N2R
Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library

    Statements

    0 references
    1.0.1
    18 January 2022
    0 references
    0.1.0
    29 September 2020
    0 references
    0.1.1
    14 December 2020
    0 references
    1.0.0
    19 November 2021
    0 references
    1.0.2
    26 February 2024
    0 references
    1.0.3
    26 February 2024
    0 references
    0 references
    26 February 2024
    0 references
    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>.
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references