Compute the Kemeny distance of a data matrix containing preference rankings, or compute the kemeny distance between two (matrices containing) rankings.
A N by M data matrix, in which there are N judges and M objects to be judged. Each row is a ranking of the objects which are represented by the columns. If there is only X as input, the output is a square distance matrix
A row vector, or a n by M data matrix in which there are n judges and the same M objects as X to be judged.
If there is anly X as input, d = square distance matrix.
If there is also Y as input, d = matrix with N rows and n columns.
Antonio D'Ambrosio <firstname.lastname@example.org>
Kemeny, J. G., & Snell, L. J. (1962). Preference ranking: an axiomatic approach. Mathematical models in the social sciences, 9-23.
1 2 3 4
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.