About: Evaluation of ranking similarity in ordinal ranking problems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 of agreement among rankings. With random rankings one cannot expect to get meaningful consensus, but if rankings are %22close%22 and represent agreement between experts, then the final group consensus has much more sense. The aim of this article is to present the 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.
  • 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 of agreement among rankings. With random rankings one cannot expect to get meaningful consensus, but if rankings are %22close%22 and represent agreement between experts, then the final group consensus has much more sense. The aim of this article is to present the 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. (en)
Title
  • Evaluation of ranking similarity in ordinal ranking problems
  • Evaluation of ranking similarity in ordinal ranking problems (en)
skos:prefLabel
  • Evaluation of ranking similarity in ordinal ranking problems
  • Evaluation of ranking similarity in ordinal ranking problems (en)
skos:notation
  • RIV/47813059:19520/11:#0001446!RIV12-MSM-19520___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I
http://linked.open...iv/cisloPeriodika
  • 2
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 198344
http://linked.open...ai/riv/idVysledku
  • RIV/47813059:19520/11:#0001446
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • correlation coefficient, decision making, ordinal ranking problem, ranking, ranking similarity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • CZ - Česká republika
http://linked.open...ontrolniKodProRIV
  • [002C45B14333]
http://linked.open...i/riv/nazevZdroje
  • Acta academica karviniensia
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Mazurek, Jiří
issn
  • 1212-415X
number of pages
http://localhost/t...ganizacniJednotka
  • 19520
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software