arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1905.02752cs.DMcs.DS
收藏

Kendall Tau序列距离:将Kendall Tau从秩推广到序列

Kendall Tau Sequence Distance: Extending Kendall Tau from Ranks to Sequences

Vincent A. Cicirello

摘要:

编辑距离是将一个结构转换为另一个结构的编辑操作的最小成本序列的度量。编辑距离最常在字符串的上下文中遇到,其中瓦格纳和菲舍尔的字符串编辑距离可能是最著名的。但是,编辑距离并不限于字符串。例如,有几种用于排列的编辑距离度量,包括瓦格纳和菲舍尔的字符串编辑距离,因为排列是字符串的特殊情况。然而,置换的另一个编辑距离是Kendall tau距离,它是成对元素反转的数量。在置换上,Kendall tau距离等价于使用相邻交换作为编辑操作的编辑距离。排列通常用于表示一组元素的总排名。存在从总排名(排列)到部分排名(即,其中多个元素可以具有相同的秩),但是这些都不适合于计算序列之间的距离。我们开始探索扩展肯德尔τ距离在一个不同的方向,即从特殊情况下的排列更一般的情况下,字符串或序列的元素从一些有限的字母表。我们将我们的距离度量命名为Kendall tau序列距离,并将其定义为将一个序列转换为另一个序列所需的相邻交换的最小数量。我们提供了两个$O(n \lg n)$算法来计算它,并通过实验比较它们的相对性能。我们还提供了这两种算法在一个开源的Java库的参考实现。

英文摘要:

An edit distance is a measure of the minimum cost sequence of edit operations to transform one structure into another. Edit distance is most commonly encountered within the context of strings, where Wagner and Fischer's string edit distance is perhaps the most well-known. However, edit distance is not limited to strings. For example, there are several edit distance measures for permutations, including Wagner and Fischer's string edit distance since a permutation is a special case of a string. However, another edit distance for permutations is Kendall tau distance, which is the number of pairwise element inversions. On permutations, Kendall tau distance is equivalent to an edit distance with adjacent swap as the edit operation. A permutation is often used to represent a total ranking over a set of elements. There exist multiple extensions of Kendall tau distance from total rankings (permutations) to partial rankings (i.e., where multiple elements may have the same rank), but none of these are suitable for computing distance between sequences. We set out to explore extending Kendall tau distance in a different direction, namely from the special case of permutations to the more general case of strings or sequences of elements from some finite alphabet. We name our distance metric Kendall tau sequence distance, and define it as the minimum number of adjacent swaps necessary to transform one sequence into the other. We provide two $O(n \lg n)$ algorithms for computing it, and experimentally compare their relative performance. We also provide reference implementations of both algorithms in an open source Java library.

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

↑