Description Usage Arguments Details Value
This implementation uses sorting of distances to identify the k elements that are nearest to each data point. The result is deterministic and exact.
1 | knn.from.dist(d, k)
|
d |
dist object or matrix with distances |
k |
integer, number of neighbors |
By definition, the first nearest neighbor to each point is the point itself. Subsequent neighbors are "true" neighbors.
list with two components; indexes identifies, for each point in dataset, the set of k neighbors distances provides distances from each point to those neighbors
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.