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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.1 |
rolling linux/jammy R-4.5 | knn.covertree_1.1.tar.gz |
87.4 KiB |
1.1 |
rolling linux/noble R-4.5 | knn.covertree_1.1.tar.gz |
89.0 KiB |
1.1 |
rolling source/ R- | knn.covertree_1.1.tar.gz |
13.6 KiB |
1.1 |
latest linux/jammy R-4.5 | knn.covertree_1.1.tar.gz |
87.4 KiB |
1.1 |
latest linux/noble R-4.5 | knn.covertree_1.1.tar.gz |
89.0 KiB |
1.1 |
latest source/ R- | knn.covertree_1.1.tar.gz |
13.6 KiB |
1.1 |
2026-04-26 source/ R- | knn.covertree_1.1.tar.gz |
13.6 KiB |
1.1 |
2026-04-23 source/ R- | knn.covertree_1.1.tar.gz |
13.6 KiB |
1.1 |
2026-04-09 windows/windows R-4.5 | knn.covertree_1.1.zip |
410.2 KiB |
1.0 |
2025-04-20 source/ R- | knn.covertree_1.0.tar.gz |
13.3 KiB |