# Kendall tau distance

The Kendall tau rank distance is a metric (distance function) that counts the number of pairwise disagreements between two ranking 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 take to place one list in the same order as the other list. The Kendall tau distance was created by Maurice Kendall.

## Definition

The Kendall tau ranking distance between two lists $\tau _{1}$ and $\tau _{2}$ is $K_{d}(\tau _{1},\tau _{2})=|\{(i,j):i<j,[\tau _{1}(i)<\tau _{1}(j)\wedge \tau _{2}(i)>\tau _{2}(j)]\vee [\tau _{1}(i)>\tau _{1}(j)\wedge \tau _{2}(i)<\tau _{2}(j)]\}|.$ where $\tau _{1}(i)$ and $\tau _{2}(i)$ are the rankings of the element $i$ in $\tau _{1}$ and $\tau _{2}$ respectively.
$K_{d}(\tau _{1},\tau _{2})$ will be equal to 0 if the two lists are identical and 1/2 n(n−1){\textstyle {\frac {1}{2}}n(n-1)} (where $n$ is the list size) if one list is the reverse of the other.
Kendall tau distance may also be defined as $K_{d}(\tau _{1},\tau _{2})=\sum _{\{i,j\}\in P,i<j}{\bar {K}}_{i,j}(\tau _{1},\tau _{2})$
where
* P is the set of unordered pairs of distinct elements in $\tau _{1}$ and $\tau _{2}$
* ${\bar {K}}_{i,j}(\tau _{1},\tau _{2})$ = 0 if i and j are in the same order in $\tau _{1}$ and $\tau _{2}$
* ${\bar {K}}_{i,j}(\tau _{1},\tau _{2})$ = 1 if i and j are in the opposite order in $\tau _{1}$ and $\tau _{2}.$
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.
The normalized Kendall tau distance $K_{n}$ is ${\frac {K_{d}}{{\frac {1}{2}}n(n-1)}}={\frac {2K_{d}}{n(n-1)}}$ and therefore lies in the interval [0,1].
If Kendall tau distance function is performed as $K(L1,L2)$ instead of $K(\tau _{1},\tau _{2})$ (where $\tau _{1}$ and $\tau _{2}$ are the rankings of $L1$ and $L2$ elements respectively), then triangular inequality is not guaranteed. The triangular inequality fails sometimes also in cases where there are repetitions in the lists. So then we are not dealing with a metric anymore.
Generalised versions of Kendall tau distance have been proposed to give weights to different items and different positions in the ranking.

## Comparison to Kendall tau rank correlation coefficient

The Kendall tau distance ($K_{d}$) must not be confused with the Kendall tau rank correlation coefficient ($K_{c}$) used in statistics.
They are related by $K_{c}=1-4K_{d}/(n(n-1))$, $K_{d}=(1-K_{c})(n(n-1))/4$
Or simpler by $K_{c}=1-2K_{n},K_{n}=(1-K_{c})/2$ where $K_{n}$ is the normalised distance $2K_{d}/(n(n-1))$ see above)
The distance is a value between 0 and $n(n-1)/2$. (The normalised distance is between 0 and 1)
The correlation is between -1 and 1.
The distance between equals is 0, the correlation between equals is 1.
The distance between reversals is $n(n-1)/2$, the correlation between reversals is -1
For example comparing the rankings A>B>C>D and A>B>C>D the distance is 0 the correlation is 1.
Comparing the rankings A>B>C>D and D>C>B>A the distance is 6 the correlation is -1
Comparing the rankings A>B>C>D and B>D>A>C the distance is 3 the correlation is 0

## Example

Suppose one ranks a group of five people by height and by weight:
| Person | A | B | C | D | E | ranking |
| Rank by height | 1 | 2 | 3 | 4 | 5 | A>B>C>D>E |
| Rank by weight | 3 | 4 | 1 | 2 | 5 | C>D>A>B>E |
Here person A is tallest and third-heaviest, B is the second -tallest and fourth-heaviest and so on.
In order to calculate the Kendall tau distance between these two rankings, 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 four pairs whose values are in opposite order, the Kendall tau distance is 4. The normalized Kendall tau distance is
    ${\frac {4}{5(5-1)/2}}=0.4.$
A value of 0.4 indicates that 40% of pairs differ in ordering between the two lists.

## Computing the Kendall tau distance

A naive implementation in Python (using NumPy) is:
However, this requires $n^{2}$ memory, which is inefficient for large arrays.
Given two rankings $\tau _{1},\tau _{2}$, it is possible to rename the items such that $\tau _{1}=(1,2,3,...)$. Then, the problem of computing the Kendall tau distance reduces to computing the number of inversions in $\tau _{2}$—the number of index pairs $i,j$ such that $i<j$ while $\tau _{2}(i)>\tau _{2}(j)$. There are several algorithms for calculating this number.
* A simple algorithm based on merge sort requires time $O(n\log n)$.
* A more advanced algorithm requires time $O(n{\sqrt {\log {n}}})$.
Here is a basic C implementation.