distSpearman: Spearman distance between two ranks
In Rankcluster: Model-Based Clustering for Multivariate Partial Ranking Data
distSpearman R Documentation
Spearman distance between two ranks
Description
The Spearman distance is the square of Euclidean distance between two rank vector.
Usage
distSpearman(x, y)
Arguments
x, y
two ranks of size m.
Value
an integer, the Spearman distance between x and y.
Author(s)
Julien Jacques
See Also
Other distance:
distCayley(),
distHamming(),
distKendall()
Examples
x <- 1:5
y <- c(2, 3, 1, 4, 5)
distSpearman(x, y)
Rankcluster documentation built on Nov. 12, 2022, 9:05 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| distSpearman | R Documentation |
Spearman distance between two ranks
Description
The Spearman distance is the square of Euclidean distance between two rank vector.
Usage
distSpearman(x, y)
Arguments
x, y |
two ranks of size m. |
Value
an integer, the Spearman distance between x and y.
Author(s)
Julien Jacques
See Also
Other distance:
distCayley(),
distHamming(),
distKendall()
Examples
x <- 1:5 y <- c(2, 3, 1, 4, 5) distSpearman(x, y)
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.