arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.4339cs.DScs.ITmath.IT
收藏

计算排序之间的相似距离

Computing Similarity Distances Between Rankings

Farzad Farnoud, Lili Su, Gregory J. Puleo, Olgica Milenkovic

摘要:

我们解决的问题,考虑到候选人之间的相似性排名之间的距离计算。评估这种距离的需要取决于各种应用,如排名聚合、生物信息学、社会科学和数据存储。问题可以总结如下:给定两个排名和一个取决于所涉及的候选人相似性的关于换位的正成本函数,找到将一个排名转换为另一个排名的换位的最小成本序列。我们的重点是成本,可以通过特殊的度量树结构和完整的排名模型的排列。所提出的结果包括一个二次时间算法,找到一个简单的周期的最小成本分解,和二次时间,$4/3$ -近似算法的置换,包含多个周期。所提出的方法依赖于调查一个新引入的平衡属性嵌入在树中的周期,周期合并的方法,和最短路径优化技术。

英文摘要:

We address the problem of computing distances between rankings that take into account similarities between candidates. The need for evaluating such distances is governed by applications as diverse as rank aggregation, bioinformatics, social sciences and data storage. The problem may be summarized as follows: Given two rankings and a positive cost function on transpositions that depends on the similarity of the candidates involved, find a smallest cost sequence of transpositions that converts one ranking into another. Our focus is on costs that may be described via special metric-tree structures and on complete rankings modeled as permutations. The presented results include a quadratic-time algorithm for finding a minimum cost decomposition for simple cycles, and a quadratic-time, $4/3$-approximation algorithm for permutations that contain multiple cycles. The proposed methods rely on investigating a newly introduced balancing property of cycles embedded in trees, cycle-merging methods, and shortest path optimization techniques.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑