distSpearman: Spearman distance between two ranks
In Rankcluster: Model-Based Clustering for Multivariate Partial Ranking Data

Description Usage Arguments Value Author(s) Examples

The Spearman distance is the square of Euclidean distance between two rank vector.

1	distSpearman(x, y)

x, y

two ranks of size m.

an integer, the Spearman distance between x and y.

Julien Jacques

1
2
3

x <- 1:5
y <- c(2, 3, 1, 4, 5)
distSpearman(x,y)

WARNING : Since Rancluster 0.92, the ranks have to be given to the package in the ranking notation (see convertRank function), with the following convention :
- missing positions are replaced by 0
- tied are replaced by the lowest position they share
[1] 6