Kendall Tau Rank Distance
(Redirected from Kendall tau distance)
Jump to navigation
Jump to search
A Kendall Tau Rank Distance is a rank distance that measures the number of pairwise disagreements between two ranking lists.
- Context:
- It can be used to quantify the dissimilarity between two lists of rankings.
- It is equivalent to the number of swaps needed by the Bubble Sort algorithm to align one list with the order of the other.
- It can be applied in various fields, including statistics, information retrieval, and data analysis.
- ...
- Example(s):
- as described by Maurice Kendall.
- See: Metric (Mathematics), Bubble Sort.
References
2023
- (Wikipedia, 2023) ⇒ https://en.wikipedia.org/wiki/Kendall_tau_distance Retrieved:2023-11-29.
- 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.
2019
- (Cicirello, 2019) ⇒ Vincent A. Cicirello. (2019). “Kendall Tau Sequence Distance: Extending Kendall Tau from Ranks to Sequences." arXiv preprint arXiv:1905.02752. [1]
- QUOTE: ... None of These are Suitable for Computing Distance Between Sequences. We Set Out to Explore Extending Kendall Tau Distance in ... Distance Metric Kendall Tau Sequence Distance, ...
2013
- (Brandenburg et al., 2013) ⇒ Franz J. Brandenburg, Andreas Gleißner, and others. (2013). “Comparing and Aggregating Partial Orders with Kendall Tau Distances." Discrete Mathematics, Algorithms and Applications. World Scientific. [DOI Link]
- QUOTE: ... Distances Can Be Computed in O(n log n) Time. We Show that the Computation of the Nearest Neighbor Kendall Tau Distance is ... We Address the Complexity of Rank Aggregation Problems in ...
2010
- (Kumar & Vassilvitskii, 2010) ⇒ Ravi Kumar, Sergei Vassilvitskii. (2010). “Generalized Distances Between Rankings." Proceedings of the 19th International Conference on World Wide Web. ACM. [DOI Link]
- QUOTE: ... Spearman’s Footrule and Kendall’s Tau are Two Well Established Distances Between Rankings. ... of the Weights, and Distances Are Set to 1, We Recover the Original Kendall’s Tau and Footrule ...