EUVIMEDEUVIMED entdecken
Crossref

Efficient Computation of the Tree Edit Distance

Mateusz Pawlik, Nikolaus Augsten

ACM Transactions on Database Systems · 25.03.2015 · 40 (1) · 1-40

DOI: 10.1145/2699485 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Database Systems, online erschienen am 25.03.2015. Verfasst von Mateusz Pawlik und 1 weiteren Autor:innen. Die Arbeit wurde bisher 106-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: RARE project funded by the Autonomous Province of Bolzano-South Tyrol, Italy, SyRA project of the Free University of Bozen-Bolzano, Italy.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We consider the classical tree edit distance between ordered labelled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into another. The state-of-the-art solutions for the tree edit distance are not satisfactory. The main competitors in the field either have optimal worst-case complexity but the worst case happens frequently, or they are very efficient for some tree shapes but degenerate for others. This leads to unpredictable and often infeasible runtimes. There is no obvious way to choose between the algorithms. In this article we present RTED, a robust tree edit distance algorithm. The asymptotic complexity of our algorithm is smaller than or equal to the complexity of the best competitors for any input instance, that is, our algorithm is both efficient and worst-case optimal. This is achieved by computing a dynamic decomposition strategy that depends on the input trees. RTED is shown optimal among all algorithms that use LRH ( left-right-heavy ) strategies, which include RTED and the fastest tree edit distance algorithms presented in literature. In our experiments on synthetic and real-world data we empirically evaluate our solution and compare it to the state-of-the-art.

Förderung

  • RARE project funded by the Autonomous Province of Bolzano-South Tyrol, Italy
  • SyRA project of the Free University of Bozen-Bolzano, Italy

Zitieren

APA

Pawlik, M., & Augsten, N. (2015). Efficient Computation of the Tree Edit Distance. ACM Transactions on Database Systems, 40(1), 1-40. https://doi.org/10.1145/2699485

Vancouver

Pawlik M, Augsten N. Efficient Computation of the Tree Edit Distance. ACM Transactions on Database Systems. 2015;40(1):1-40. doi:10.1145/2699485

BibTeX
@article{Pawlik2015,
  author = {Pawlik, Mateusz and Augsten, Nikolaus},
  title = {Efficient Computation of the Tree Edit Distance},
  journal = {ACM Transactions on Database Systems},
  year = {2015},
  volume = {40},
  number = {1},
  pages = {1--40},
  doi = {10.1145/2699485}
}
Kostenlos starten →