The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.

rnndescent: Nearest Neighbor Descent Method for Approximate Nearest Neighbors

The Nearest Neighbor Descent method for finding approximate nearest neighbors by Dong and co-workers (2010) <doi:10.1145/1963405.1963487>. Based on the 'Python' package 'PyNNDescent' <https://github.com/lmcinnes/pynndescent>.

Version: 0.1.6
Imports: dqrng, Matrix (≥ 1.3-0), methods, Rcpp
LinkingTo: BH, dqrng, Rcpp, sitmo
Suggests: covr, knitr, rmarkdown, testthat
Published: 2024-05-14
DOI: 10.32614/CRAN.package.rnndescent
Author: James Melville [aut, cre, cph], Vitalie Spinu [ctb], Ralf Stubner [ctb]
Maintainer: James Melville <jlmelville at gmail.com>
BugReports: https://github.com/jlmelville/rnndescent/issues
License: GPL (≥ 3)
URL: https://jlmelville.github.io/rnndescent/, https://github.com/jlmelville/rnndescent
NeedsCompilation: yes
SystemRequirements: C++17
Materials: NEWS
CRAN checks: rnndescent results

Documentation:

Reference manual: rnndescent.pdf
Vignettes: Brute Force Search
Hubness
Metrics
Nearest Neighbor Descent
Querying Data
Random Partition Forests
rnndescent

Downloads:

Package source: rnndescent_0.1.6.tar.gz
Windows binaries: r-devel: rnndescent_0.1.6.zip, r-release: rnndescent_0.1.6.zip, r-oldrel: rnndescent_0.1.6.zip
macOS binaries: r-release (arm64): rnndescent_0.1.6.tgz, r-oldrel (arm64): rnndescent_0.1.6.tgz, r-release (x86_64): rnndescent_0.1.6.tgz, r-oldrel (x86_64): rnndescent_0.1.6.tgz
Old sources: rnndescent archive

Reverse dependencies:

Reverse suggests: uwot

Linking:

Please use the canonical form https://CRAN.R-project.org/package=rnndescent to link to this page.

These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.