N2R
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,
- Version1.0.3
- R versionunknown
- LicenseApache License 2.0
- Needs compilation?Yes
- Last release02/26/2024
Documentation
Team
Evan Biederstedt
Peter Kharchenko
Show author detailsRolesAuthorViktor Petukhov
Show author detailsRolesAuthorDirk Eddelbuettel
Show author detailsRolesContributor
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Imports1 package
- Suggests1 package
- Linking To3 packages
- Reverse Imports2 packages