N2R

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.

Last 30 days

This package has been downloaded 619 times in the last 30 days. More downloads than an obscure whitepaper, but not enough to bring down any servers. A solid effort! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 10 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 8,589 times in the last 365 days. Impressive! The kind of number that makes colleagues ask, 'How did you do it?' The day with the most downloads was Sep 11, 2024 with 54 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.