Universal aggregation of permutations - Archive ouverte HAL Accéder directement au contenu
Proceedings/Recueil Des Communications Année : 2022

Universal aggregation of permutations

Résumé

The estimation of the median and mean is a central problem in statistics. When it comes to permutation data the median estimation problem is called aggregation problem. The problem is challenging both computationally and statistically, since provable algorithms are known only for a hand-full of cases. In this paper, we consider the permutation aggregation problem in a general probabilistic setting. This algorithm is given a data-set drawn form a distribution P and a choose for a distance function d and outputs the provably good estimator for the median of P in polynomial time. For the first time, one algorithm can be shown to work for different generating distributions.
Fichier principal
Vignette du fichier
DA2PL_paper_8600 (1).pdf (395.25 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03972357 , version 1 (03-02-2023)

Identifiants

  • HAL Id : hal-03972357 , version 1

Citer

Ekhine Irurozki, Stéphan Clémençon. Universal aggregation of permutations. Proceedings of DA2PL 2022 : From Multiple-Criteria Decision Aid to Preference Learning, 2022. ⟨hal-03972357⟩
18 Consultations
13 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More