Description Usage Arguments Value
Create a distance matrix/vector where the actual distances from samples are replaced by their mean ranks. This should allow for scale-independent, robust distance matrices.
1 2 3 | dist.apply.samples.ranked(X, FUN = distance.euclidean, sampler = identity,
rank.all = rank.dist, rank.fromSingle = identity, aggregate = mean,
FUN.VALUE = +Inf, cores = 1L, logging = FALSE)
|
X |
the list or vector of elements to be compared |
FUN |
the distance function, a function accepting two samples and returning one distance value |
sampler |
the sampling function, returning a vector or list of samples
for an element of |
rank.all |
the ranking to be applied to all distances |
rank.fromSingle |
the ranking to be applied to all the distances from one specific sample to the other samples |
aggregate |
the aggregation function which will join distances computed
with |
FUN.VALUE |
the value to be used for situations where an element of
|
cores |
the number of cores to be used for parallel computation |
logging |
the logging setup, see |
a vector of values that can be used to produce a distance matrix
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.