knn.covertree: An Accurate kNN Implementation with Multiple Distance Measures

Similarly to the 'FNN' package, this package allows calculation of the k nearest neighbors (kNN) of a data matrix. The implementation is based on cover trees introduced by Alina Beygelzimer, Sham Kakade, and John Langford (2006) <doi:10.1145/1143844.1143857>.

Version: 1.0
Imports: Rcpp (≥ 1.0.2), RcppEigen (≥ 0.3.3.5.0), Matrix, methods
LinkingTo: Rcpp, RcppEigen
Suggests: testthat, FNN
Published: 2019-10-28
Author: Philipp Angerer ORCID iD [cre, aut], David Crane [cph, aut]
Maintainer: Philipp Angerer <philipp.angerer at helmholtz-muenchen.de>
BugReports: https://github.com/flying-sheep/knn.covertree/issues
License: AGPL-3
URL: https://github.com/flying-sheep/knn.covertree
NeedsCompilation: yes
SystemRequirements: C++11
Materials: README
CRAN checks: knn.covertree results

Downloads:

Reference manual: knn.covertree.pdf
Package source: knn.covertree_1.0.tar.gz
Windows binaries: r-devel: knn.covertree_1.0.zip, r-devel-gcc8: knn.covertree_1.0.zip, r-release: knn.covertree_1.0.zip, r-oldrel: knn.covertree_1.0.zip
OS X binaries: r-release: knn.covertree_1.0.tgz, r-oldrel: knn.covertree_1.0.tgz

Linking:

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