2000 character limit reached
A Weighted Generalization of the Graham-Diaconis Inequality for Ranked List Similarity
Published 15 Apr 2018 in cs.DS | (1804.05420v1)
Abstract: The Graham-Diaconis inequality shows the equivalence between two well-known methods of measuring the similarity of two given ranked lists of items: Spearman's footrule and Kendall's 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.