arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.06134cs.DS
收藏

编辑距离近似算法的实用精度

On Practical Accuracy of Edit Distance Approximation Algorithms

Hiroyuki Hanada, Mineichi Kudo, Atsuyoshi Nakamura

摘要:

编辑距离是文本挖掘、信号处理、生物信息学等领域中常用的字符串相似性度量,但在实际搜索中,重复计算距离会带来计算开销问题。一个有前途的解决方案,以应付这个问题是近似的编辑距离的另一个距离,以较低的计算成本。事实上,已经提出了许多距离来近似编辑距离。然而,它们的近似精度仅在理论上进行评估:其中许多仅用big-oh(渐近)符号进行评估,而没有实验分析。因此,了解它们在实际应用中的实际性能是有益的。在这项研究中,我们比较了两种方法中现有的六种近似距离:(i)我们通过计算常数系数来改进其理论近似精度,以及(ii)我们在一个人工和两个真实数据集中进行了一些实验,以揭示在哪些情况下它们表现最好。因此,我们得到了以下结果:[Batu 2006]在理论上和[Andoni 2010]在实验上是最好的。理论上的考虑表明,[Batu 2006]是最好的,如果字符串长度n足够大(n >= 300)。[Andoni 2010]在实验上是大多数数据集的最佳选择,在理论上是第二佳选择。[Bar-Yossef 2004],[Charikar 2006]和[Sokolov 2007],尽管他们的中等水平的理论性能,在实验上与[Andoni 2010]一样好,对于具有大字母大小的字符串对。

英文摘要:

The edit distance is a basic string similarity measure used in many applications such as text mining, signal processing, bioinformatics, and so on. However, the computational cost can be a problem when we repeat many distance calculations as seen in real-life searching situations. A promising solution to cope with the problem is to approximate the edit distance by another distance with a lower computational cost. There are, indeed, many distances have been proposed for approximating the edit distance. However, their approximation accuracies are evaluated only theoretically: many of them are evaluated only with big-oh (asymptotic) notations, and without experimental analysis. Therefore, it is beneficial to know their actual performance in real applications. In this study we compared existing six approximation distances in two approaches: (i) we refined their theoretical approximation accuracy by calculating up to the constant coefficients, and (ii) we conducted some experiments, in one artificial and two real-life data sets, to reveal under which situations they perform best. As a result we obtained the following results: [Batu 2006] is the best theoretically and [Andoni 2010] experimentally. Theoretical considerations show that [Batu 2006] is the best if the string length n is large enough (n >= 300). [Andoni 2010] is experimentally the best for most data sets and theoretically the second best. [Bar-Yossef 2004], [Charikar 2006] and [Sokolov 2007], despite their middle-level theoretical performance, are experimentally as good as [Andoni 2010] for pairs of strings with large alphabet size.

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

↑