Developing the Kemeny's Weighted Median for the Rank Aggregation Problem

S. Dvoenko, D. O. Pshenichny
{"title":"Developing the Kemeny's Weighted Median for the Rank Aggregation Problem","authors":"S. Dvoenko, D. O. Pshenichny","doi":"10.1145/3440749.3442652","DOIUrl":null,"url":null,"abstract":"A coordinated ranking as the opinion of an expert group usually can be represented by the well-known Kemeny's median. The Kemeny's median is the least different ranking from other rankings and is free of known contradictions of the majority rule problem. As a mathematical principle, the Kemeny's median gives a decision in any case, in particular, for conflicting experts’ decisions in ordinal scales. In practice, competing opinions are usually modified by special approval procedures to achieve the required level of consensus. The known approach consists in assigning weights to experts’ opinions. In this paper, the problem to find the median for a linear combination of experts’ rankings is investigated using the well-known locally optimal Kemeny's algorithm. It is proposed to use the weighted loss matrix in it.","PeriodicalId":344578,"journal":{"name":"Proceedings of the 4th International Conference on Future Networks and Distributed Systems","volume":"277 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Future Networks and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3440749.3442652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A coordinated ranking as the opinion of an expert group usually can be represented by the well-known Kemeny's median. The Kemeny's median is the least different ranking from other rankings and is free of known contradictions of the majority rule problem. As a mathematical principle, the Kemeny's median gives a decision in any case, in particular, for conflicting experts’ decisions in ordinal scales. In practice, competing opinions are usually modified by special approval procedures to achieve the required level of consensus. The known approach consists in assigning weights to experts’ opinions. In this paper, the problem to find the median for a linear combination of experts’ rankings is investigated using the well-known locally optimal Kemeny's algorithm. It is proposed to use the weighted loss matrix in it.
秩聚集问题的Kemeny加权中值
作为专家组意见的协调排名通常可以用著名的凯梅尼中位数来表示。凯梅尼的中位数排名与其他排名差别最小,而且不存在多数决定原则问题的已知矛盾。作为一个数学原理,凯梅尼中值在任何情况下都会给出一个决定,特别是对于在有序尺度上相互冲突的专家的决定。在实践中,相互矛盾的意见通常通过特别的批准程序加以修改,以达到所需的协商一致程度。已知的方法包括为专家的意见分配权重。本文利用著名的局部最优Kemeny算法研究了专家排名线性组合的中位数问题。提出了在其中使用加权损失矩阵的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信