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 (≥, Matrix, methods
LinkingTo: Rcpp, RcppEigen
Suggests: testthat, FNN
Published: 2019-10-28
DOI: 10.32614/CRAN.package.knn.covertree
Author: Philipp Angerer ORCID iD [cre, aut], David Crane [cph, aut]
Maintainer: Philipp Angerer <philipp.angerer at>
License: AGPL-3
NeedsCompilation: yes
SystemRequirements: C++11
Materials: README
CRAN checks: knn.covertree results


Reference manual: knn.covertree.pdf


Package source: knn.covertree_1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): knn.covertree_1.0.tgz, r-oldrel (arm64): knn.covertree_1.0.tgz, r-release (x86_64): knn.covertree_1.0.tgz, r-oldrel (x86_64): knn.covertree_1.0.tgz

Reverse dependencies:

Reverse imports: destiny


Please use the canonical form to link to this page.