Description Usage Arguments Value Examples
View source: R/permutationDistances.r
Chebyshev distance for permutations. Specific to permutations is only the scaling to values of 0 to 1:
d(x,y) = max(|x - y|) / (n-1)
where n is the length of the permutations x and y.
1 |
x |
first permutation (integer vector) |
y |
second permutation (integer vector) |
numeric distance value
d(x,y)
, scaled to values between 0 and 1 (based on the maximum possible distance between two permutations)
1 2 3 4 5 | x <- 1:5
y <- c(5,1,2,3,4)
distancePermutationChebyshev(x,y)
p <- replicate(10,sample(1:5),simplify=FALSE)
distanceMatrix(p,distancePermutationChebyshev)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.