SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees

被引：6

作者：

McVicar, Matt ^{[1
]}

Sach, Benjamin ^{[2
]}

Mesnage, Cedric ^{[1
]}

Lijffijt, Jefrey ^{[1
,3
]}

Spyropoulou, Eirini ^{[1
]}

De Bie, Tijl ^{[1
,3
]}

机构：

[1] Univ Bristol, Dept Engn Math, Woodland Rd, Bristol BS8 1UB, England

[2] Univ Bristol, Dept Comp Sci, Woodland Rd, Bristol BS8 1UB, England

[3] Univ Ghent, Data Sci Lab, B-9000 Ghent, Belgium

来源：

PATTERN RECOGNITION LETTERS | 2016年 / 79卷

基金：

欧洲研究理事会; 英国工程与自然科学研究理事会;

关键词：

Tree edit distance; Taxonomies; ALGORITHMS;

D O I：

10.1016/j.patrec.2016.04.012

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Defining and computing distances between tree structures is a classical area of study in theoretical computer science, with practical applications in the areas of computational biology, information retrieval, text analysis, and many others. In this paper, we focus on rooted, unordered, uniquely-labelled trees such as taxonomies and other hierarchies. For trees as these, we introduce the intuitive concept of a 'local move' operation as an atomic edit of a tree. We then introduce SuMoTED, a new edit distance measure between such trees, defined as the minimal number of local moves required to convert one tree into another. We show how SuMoTED can be computed using a scalable algorithm with quadratic time complexity. Finally, we demonstrate its use on a collection of music genre taxonomies. (C) 2016TheAuthors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

引用

页码：52 / 59

页数：8