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

具有自定义代价的无序树编辑距离的A*-算法

An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs

Humboldt-University of Berlin(柏林洪堡大学)

Benjamin Paaßen

摘要:

无序树编辑距离是计算没有内在子顺序的树之间的距离的自然度量,例如化学分子的表示。虽然无序树编辑距离原则上是MAX SNP难的,但它对于小的情况是可行的,例如通过A* 算法。不幸的是,目前A* 算法的算法假设删除,插入和替换的单位成本,这限制了我们注入领域知识的能力。在本文中,我们提出了三个新的算法的A* 算法,自定义成本函数。在两个化学数据集上的实验中,我们表明自定义成本使A* 计算更快,并改善了5-最近邻回归的误差,预测化学性质。我们还表明,在这些数据上,多项式编辑距离可以达到与无序树编辑距离类似的结果。

英文摘要:

The unordered tree edit distance is a natural metric to compute distances between trees without intrinsic child order, such as representations of chemical molecules. While the unordered tree edit distance is MAX SNP-hard in principle, it is feasible for small cases, e.g. via an A* algorithm. Unfortunately, current heuristics for the A* algorithm assume unit costs for deletions, insertions, and replacements, which limits our ability to inject domain knowledge. In this paper, we present three novel heuristics for the A* algorithm that work with custom cost functions. In experiments on two chemical data sets, we show that custom costs make the A* computation faster and improve the error of a 5-nearest neighbor regressor, predicting chemical properties. We also show that, on these data, polynomial edit distances can achieve similar results as the unordered tree edit distance.

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

↑