Evaluation of ranking similarity in ordinal ranking problems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F11%3A%230001446" target="_blank" >RIV/47813059:19520/11:#0001446 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Evaluation of ranking similarity in ordinal ranking problems

Popis výsledku v původním jazyce

In ordinal ranking problems objects, alternatives, products, services, etc. are ranked by several experts and the goal is to convert a set of (generally different) rankings into the final group consensus ranking. However, this goal depends on a degree ofagreement among rankings. With random rankings one cannot expect to get meaningful consensus, but if rankings are "close" and represent agreement between experts, then the final group consensus has much more sense. The aim of this article is to presentthe evaluation of similarity among rankings, which is based on Kendall's ? and W, Spearman's ?, Pearson's r and dot product of vectors. Cases without and with ties are discussed as well as a problem of similarity between incomplete rankings (top k lists). Explanations are based on examples.

Název v anglickém jazyce

Evaluation of ranking similarity in ordinal ranking problems

Popis výsledku anglicky

In ordinal ranking problems objects, alternatives, products, services, etc. are ranked by several experts and the goal is to convert a set of (generally different) rankings into the final group consensus ranking. However, this goal depends on a degree ofagreement among rankings. With random rankings one cannot expect to get meaningful consensus, but if rankings are "close" and represent agreement between experts, then the final group consensus has much more sense. The aim of this article is to presentthe evaluation of similarity among rankings, which is based on Kendall's ? and W, Spearman's ?, Pearson's r and dot product of vectors. Cases without and with ties are discussed as well as a problem of similarity between incomplete rankings (top k lists). Explanations are based on examples.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

AH - Ekonomie

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Acta academica karviniensia

ISSN

1212-415X

e-ISSN

—

Svazek periodika

—

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

10

Strana od-do

119-128

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—