一致性与偏好序的最小覆盖集
Concordance and the Smallest Covering Set of Preference Orderings
摘要:
偏好排序是根据(法官的)偏好对一组项目进行排序。这种排序出现在各种领域,包括群体决策、消费者营销、投票和机器学习。度量偏好排序中的互信息和提取偏好排序中的共同模式是这些领域的关键。在本文中,我们处理的表示集的偏好排序,量化的程度,法官同意他们的排序的项目(即和谐),以及有效的,有意义的描述,这样的集合。我们建议表示在一个基于排序的特征空间中的排序,并提出了一种新的算法来计算所有常见的排序集的大小-一致性的量化的基础上,不仅对排序,而且对排序集。新算法具有快速、存储效率高的特点,其时间复杂度仅为$n$,空间复杂度仅为$O(\min\{Nn,n^2\})$ .此外,我们建议通过一个最小的覆盖偏好集来表示所有$N$排序的集合,并给出了一个构造这个最小覆盖集的算法。算法的源代码可在https://github.com/zhiweiuu/secs上获得
英文摘要:
Preference orderings are orderings of a set of items according to the preferences (of judges). Such orderings arise in a variety of domains, including group decision making, consumer marketing, voting and machine learning. Measuring the mutual information and extracting the common patterns in a set of preference orderings are key to these areas. In this paper we deal with the representation of sets of preference orderings, the quantification of the degree to which judges agree on their ordering of the items (i.e. the concordance), and the efficient, meaningful description of such sets. We propose to represent the orderings in a subsequence-based feature space and present a new algorithm to calculate the size of the set of all common subsequences - the basis of a quantification of concordance, not only for pairs of orderings but also for sets of orderings. The new algorithm is fast and storage efficient with a time complexity of only $O(Nn^2)$ for the orderings of $n$ items by $N$ judges and a space complexity of only $O(\min\{Nn,n^2\})$. Also, we propose to represent the set of all $N$ orderings through a smallest set of covering preferences and present an algorithm to construct this smallest covering set. The source code for the algorithms is available at https://github.com/zhiweiuu/secs
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。