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.
Version: |
0.0.1 |
Imports: |
pdist, assertthat |
Published: |
2015-02-12 |
Author: |
Gaston Besanson |
Maintainer: |
Gaston Besanson <besanson at gmail.com> |
License: |
GPL-3 |
NeedsCompilation: |
no |
CRAN checks: |
FastKNN results |
Documentation:
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=FastKNN
to link to this page.