N2R

CRANN2RMaRDI QIDQ93224FDOQ93224

Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library

Peter Kharchenko, Viktor Petukhov, Evan Biederstedt

Last update: 26 February 2024

Copyright license: Apache License, Version 2.0

Software version identifier: 1.0.1, 0.1.0, 0.1.1, 1.0.0, 1.0.2, 1.0.3

Description

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

Cites work

• Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
• Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs

Cited In (2)

• conos
• pagoda2

This page was built for software: N2R