A Weighted Generalization of the Graham-Diaconis Inequality for Ranked List Similarity.

arXiv: Data Structures and Algorithms(2018)

引用 23|浏览1
暂无评分
摘要
The Graham-Diaconis inequality shows the equivalence between two well-known methods of measuring the similarity of two given ranked lists of items: Spearmanu0027s footrule and Kendallu0027s tau. The original inequality assumes unweighted items in input lists. In this paper, we first define versions of these methods for weighted items. We then prove a generalization of the inequality for the weighted versions.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要