Chebyshev Distance for Permutations
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.
distancePermutationChebyshev(x, y)
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)
x <- 1:5 y <- c(5,1,2,3,4) distancePermutationChebyshev(x,y) p <- replicate(10,sample(1:5),simplify=FALSE) distanceMatrix(p,distancePermutationChebyshev)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.