Define a design matrix to compute Kemeny distance
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 represented by the columns.
Antonio D'Ambrosio email@example.com
D'Ambrosio, A. (2008). Tree based methods for data editing and preference rankings. Unpublished PhD Thesis. Universita' degli Studi di Napoli Federico II.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.