A variant of the ranking aggregation problem is considered in this work. The goal is to find an approximation of an unknown true ranking given a set of rankings. We devise a solution called Belief Ranking Estimator (BRE), based on the belief function framework that permits to represent beliefs on the correctness of the rankings position as well as uncertainty on the quality of the rankings from the subjective point of view of the expert. The results of a preliminary empirical comparison of BRE against baseline ranking estimators and state-of-the-art methods for ranking aggregation are shown and discussed.
Unsupervised Learning of True Ranking Estimators using the Belief Function Framework / Blanzieri, Enrico; Argentini, Andrea. - ELETTRONICO. - (2011), pp. 1-10.
Unsupervised Learning of True Ranking Estimators using the Belief Function Framework
Blanzieri, EnricoUltimo
;Argentini, Andrea
Primo
2011-01-01
Abstract
A variant of the ranking aggregation problem is considered in this work. The goal is to find an approximation of an unknown true ranking given a set of rankings. We devise a solution called Belief Ranking Estimator (BRE), based on the belief function framework that permits to represent beliefs on the correctness of the rankings position as well as uncertainty on the quality of the rankings from the subjective point of view of the expert. The results of a preliminary empirical comparison of BRE against baseline ranking estimators and state-of-the-art methods for ranking aggregation are shown and discussed.File | Dimensione | Formato | |
---|---|---|---|
ECSQARU_tech.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
547.74 kB
Formato
Adobe PDF
|
547.74 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione