Evaluation of ranking similarity in ordinal ranking problems

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Evaluation of ranking similarity in ordinal ranking problems

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

AH - Economics

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2011

Confidentiality

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

Name of the periodical

Acta academica karviniensia

ISSN

1212-415X

e-ISSN

—

Volume of the periodical

—

Issue of the periodical within the volume

2

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

10

Pages from-to

119-128

UT code for WoS article

—

EID of the result in the Scopus database

—