Description Usage Arguments Value Examples
The k
parameter for the k nearest neighbors used in DiffusionMap should be as big as possible while
still being computationally feasible. This function approximates it depending on the size of the dataset n
.
1 | find_dm_k(n, min_k = 100L, small = 1000L, big = 10000L)
|
n |
Number of possible neighbors (nrow(dataset) - 1) |
min_k |
Minimum number of neighbors. Will be chosen for n ≥ big |
small |
Number of neighbors considered small. If/where n ≤ small, n itself will be returned. |
big |
Number of neighbors considered big. If/where n ≥ big, |
A vector of the same length as n
that contains suitable k
values for the respective n
1 2 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.