FastKNN
Fast k-Nearest Neighbors
Compute labels for a test set according to the k-Nearest Neighbors classification. This is a fast way to do k-Nearest Neighbors classification because the distance matrix -between the features of the observations- is an input to the function rather than being calculated in the function itself every time.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.0.1 |
rolling linux/jammy R-4.5 | FastKNN_0.0.1.tar.gz |
17.9 KiB |
0.0.1 |
rolling linux/noble R-4.5 | FastKNN_0.0.1.tar.gz |
17.9 KiB |
0.0.1 |
rolling source/ R- | FastKNN_0.0.1.tar.gz |
2.6 KiB |
0.0.1 |
latest linux/jammy R-4.5 | FastKNN_0.0.1.tar.gz |
17.9 KiB |
0.0.1 |
latest linux/noble R-4.5 | FastKNN_0.0.1.tar.gz |
17.9 KiB |
0.0.1 |
latest source/ R- | FastKNN_0.0.1.tar.gz |
2.6 KiB |
0.0.1 |
2026-04-26 source/ R- | FastKNN_0.0.1.tar.gz |
2.6 KiB |
0.0.1 |
2026-04-23 source/ R- | FastKNN_0.0.1.tar.gz |
2.6 KiB |
0.0.1 |
2026-04-09 windows/windows R-4.5 | FastKNN_0.0.1.zip |
20.8 KiB |
0.0.1 |
2025-04-20 source/ R- | FastKNN_0.0.1.tar.gz |
2.6 KiB |