Scholarlink

Abstract <p>The problem of coordination of individual preferences represented by strict and nonstrict rankings based on the Kemeny median is considered. It is shown that in order to calculate the distances between nonstrict rankings and build a loss matrix in the Kemeny algorithm, two relationship matrices are used for each ranking. As a result, the classic and new types of the Kemeny median are used to develop coordinated individual preferences.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the Coordination of Nonstrict Preferences in Machine Learning

  • 期刊论文

  • 发表日期：

    2025年12月1日

查看全文
  • S. D. Dvoenko

摘要

Abstract

The problem of coordination of individual preferences represented by strict and nonstrict rankings based on the Kemeny median is considered. It is shown that in order to calculate the distances between nonstrict rankings and build a loss matrix in the Kemeny algorithm, two relationship matrices are used for each ranking. As a result, the classic and new types of the Kemeny median are used to develop coordinated individual preferences.