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

04/15/2018
by   Ali Dasdan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2023

A useful inequality of inverse hyperbolic tangent

We prove an inequality related to arctanh, resolving a conjecture of Gu ...
research
09/27/2022

From Ranked Lists to Carousels: A Carousel Click Model

Carousel-based recommendation interfaces allow users to explore recommen...
research
11/06/2018

Computing Entity Semantic Similarity by Features Ranking

This article presents a novel approach to estimate semantic entity simil...
research
09/07/2017

Ranking ideas for diversity and quality

When selecting ideas or trying to find inspiration, designers often must...
research
01/10/2018

Buying Online - A Characterization of Rational Buying Procedures

In decision theory, an agent chooses from a set of alternatives. When bu...
research
10/16/2014

Multivariate Spearman's rho for aggregating ranks using copulas

We study the problem of rank aggregation: given a set of ranked lists, w...
research
10/11/2018

Offline Comparison of Ranking Functions using Randomized Data

Ranking functions return ranked lists of items, and users often interact...

Please sign up or login with your details

Forgot password? Click here to reset