Kendall tau distance
this wiki
Ad blocker interference detected!
Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers
Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.
Assessment |
Biopsychology |
Comparative |
Cognitive |
Developmental |
Language |
Individual differences |
Personality |
Philosophy |
Social |
Methods |
Statistics |
Clinical |
Educational |
Industrial |
Professional items |
World psychology |
Statistics: Scientific method · Research methods · Experimental design · Undergraduate statistics courses · Statistical tests · Game theory · Decision theory
The Kendall tau distance is a metric that counts the number of pairwise disagreements between two lists. The larger the distance, the more dissimilar the two lists are. Kendall tau distance is also called bubble-sort distance since it is equivalent to the number of swaps that the bubble sort algorithm would make to place one list in the same order as the other list. The Kendall tau distance was created by Maurice Kendall.
DefinitionEdit
The Kendall tau distance between two lists and is
will be equal to 0 if the two lists are identical and (where is the list size) if one list is the reverse of the other. Often Kendall tau distance is normalized by dividing by so a value of 1 indicates maximum disagreement. The normalized Kendall tau distance therefore lies in the interval [0,1].
Kendall tau distance may also be defined as
where
- P is the set of unordered pairs of distinct elements in and
- = 0 if i and j are in the same order in and
- = 1 if i and j are in the opposite order in and
Kendall tau distance can also be defined as the total number of discordant pairs.
Kendall tau distance in Rankings: A permutation (or ranking) is an array of N integers where each of the integers between 0 and N-1 appears exactly once. The Kendall tau distance between two rankings is the number of pairs that are in different order in the two rankings. For example the Kendall tau distance between 0 3 1 6 2 5 4 and 1 0 3 6 4 2 5 is four because the pairs 0-1, 3-1, 2-4, 5-4 are in different order in the two rankings, but all other pairs are in the same order. ^{[1]}
ExampleEdit
Suppose we rank a group of five people by height and by weight:
Person | A | B | C | D | E |
---|---|---|---|---|---|
Rank by Height | 1 | 2 | 3 | 4 | 5 |
Rank by Weight | 3 | 4 | 1 | 2 | 5 |
Here person A is tallest and third-heaviest, and so on.
In order to calculate the Kendall tau distance, pair each person with every other person and count the number of times the values in list 1 are in the opposite order of the values in list 2.
Pair | Height | Weight | Count |
---|---|---|---|
(A,B) | 1 < 2 | 3 < 4 | |
(A,C) | 1 < 3 | 3 > 1 | X |
(A,D) | 1 < 4 | 3 > 2 | X |
(A,E) | 1 < 5 | 3 < 5 | |
(B,C) | 2 < 3 | 4 > 1 | X |
(B,D) | 2 < 4 | 4 > 2 | X |
(B,E) | 2 < 5 | 4 < 5 | |
(C,D) | 3 < 4 | 1 < 2 | |
(C,E) | 3 < 5 | 1 < 5 | |
(D,E) | 4 < 5 | 2 < 5 |
Since there are 4 pairs whose values are in opposite order, the Kendall tau distance is 4. The normalized Kendall tau distance is
A value of 0.4 indicates a somewhat low agreement in the rankings.
See alsoEdit
- Kendall tau rank correlation coefficient
- Spearman's rank correlation coefficient
- Kemeny-Young (`maximum likelihood') voting rule
ReferencesEdit
- Fagin, R., Kumar, R., and Sivakumar, D. (2003). Comparing top k lists. SIAM Journal on Discrete Mathematics 17 (1): 134–160.
- Kendall, M. (1948) Rank Correlation Methods, Charles Griffin & Company Limited
- Kendall, M. (1938) "A New Measure of Rank Correlation", Biometrika, 30, 81-89.
External linksEdit
This page uses Creative Commons Licensed content from Wikipedia (view authors). |