The problem of interpreting or aggregating multiple rankings is common to many real-world applications. Perhaps the simplest and most common approach is a weighted rank aggregation, wherein a (convex) weight is applied to each input ranking and then ordered. This paper describes a new tool for visualizing and displaying ranking information for the weighted rank aggregation method. Traditionally, the aim of rank aggregation is to summarize the information from the input rankings and provide one final ranking that hopefully represents a more accurate or truthful result than any one input ranking. While such an aggregated ranking is, and clearly has been, useful to many applications, it also obscures information. In this paper, we show the wealth of information that is available for the weighted rank aggregation problem due to its structure. We apply weight set decomposition to the set of convex multipliers, study the properties useful for understanding this decomposition, and visualize the indifference regions. This methodology reveals information--that is otherwise collapsed by the aggregated ranking--into a useful, interpretable, and intuitive decision support tool. Included are multiple illustrative examples, along with heuristic and exact algorithms for computing the weight set decomposition.
翻译:解释或汇总多重排名的问题在许多现实世界应用中是常见的。也许最简单和最常见的方法是加权排名总和,即将(covex)加权用于每项输入排名,然后订购。本文描述了为加权排名总和法提供可视化和显示排名信息的新工具。从传统上看,排名总和的目的是总结输入排名中的信息,并提供最后排名,希望这比任何输入排名都更准确或更真实。虽然这种汇总排序对许多应用有用,但它也模糊了信息。在本文中,我们展示了加权排名总和问题因其结构而可获得的丰富信息。我们将加权权重组分解用于组合乘数组,研究有助于理解这种分解的属性,并对不相干区域进行直观化。这一方法揭示了信息-否则会因汇总的排序而崩溃到一个有用的、可解释的和直观的决定支持工具。此外,还有多个示例,以及计算权重组脱位的超和精确算法。