Kantorovich Distances between Rankings with Applications to Rank Aggregation - Télécom Paris Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

Kantorovich Distances between Rankings with Applications to Rank Aggregation

Résumé

The goal of this paper is threefold. It first describes a novel way of measuring disagreement between rankings of a finite set X of n ≥ 1 elements, that can be viewed as a (mass transportation) Kantorovich metric, once the collection rankings of X is embedded in the set Kn of n×n doubly-stochastic matrices. It also shows that such an embedding makes it possible to define a natural notion of median, that can be interpreted in a probabilistic fashion. In addition, from a computational perspective, the convexification induced by this approach makes median computation more tractable, in contrast to the standard metric-based method that generally yields NP-hard optimization problems. As an illustration, this novel methodology is applied to the issue of ranking aggregation, and is shown to compete with state of the art techniques.

Dates et versions

hal-02107286 , version 1 (23-04-2019)

Identifiants

Citer

Stéphan Clémençon, Jérémie Jakubowicz. Kantorovich Distances between Rankings with Applications to Rank Aggregation. Kantorovich Distances between Rankings with Applications to Rank Aggregation, Springer, pp.248-263, 2010, ECML PKDD 2010: Machine Learning and Knowledge Discovery in Databases, ⟨10.1007/978-3-642-15880-3_22⟩. ⟨hal-02107286⟩
21 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More