Tree edit distance from information theory

被引：0
|
作者：
Torsello, A [1 ]
Hancock, ER [1 ]
机构：
[1] Univ York, Dept Comp Sci, York YO10 5DD, N Yorkshire, England
来源：
GRAPH BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS | 2003年 / 2726卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper presents a method for estimating the cost of tree edit operations. The approach poses the problem as that of estimating a generative model for a set of tree samples. The generative model uses the tree-union as the structural archetype for every tree in the distribution and assigns to each node in the archetype the probability that the node is present in a sample. A minimum descriptor length formulation is then used to estimate the structure and parameters of this tree model as well as the node-correspondences between trees in the sample-set and the tree model.
引用
收藏
页码：71 / 82
页数：12
相关论文
共 50 条
  • [41] Top-Down Tree Edit-Distance of Regular Tree Languages
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 466 - 477
  • [42] Top-down tree edit-distance of regular tree languages
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    INTERNATIONAL JOURNAL OF ADVANCES IN ENGINEERING SCIENCES AND APPLIED MATHEMATICS, 2019, 11 (01) : 2 - 10
  • [43] Top-down tree edit-distance of regular tree languages
    Sang-Ki Ko
    Yo-Sub Han
    Kai Salomaa
    International Journal of Advances in Engineering Sciences and Applied Mathematics, 2019, 11 : 2 - 10
  • [44] Dependency Tree Matching with Extended Tree Edit Distance with Subtrees for Textual Entailment
    Alabbas, Maytham
    Ramsay, Allan
    2012 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2012, : 11 - 18
  • [45] The Tree-Edit-Distance, a Measure for Quantifying Neuronal Morphology
    Holger Heumann
    Gabriel Wittum
    Neuroinformatics, 2009, 7 : 179 - 190
  • [46] X-TED: Massive Parallelization of Tree Edit Distance
    Fan, Dayi
    Lee, Rubao
    Zhang, Xiaodong
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (07): : 1683 - 1696
  • [47] A Dynamic Programming A* Algorithm for Computing Unordered Tree Edit Distance
    Yoshino, Takuya
    Higuchi, Shoichi
    Hirata, Kouichi
    2013 SECOND IIAI INTERNATIONAL CONFERENCE ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2013), 2013, : 135 - 140
  • [48] On Comparing Neuronal Morphologies with the Constrained Tree-edit-distance
    Todd A. Gillette
    John J. Grefenstette
    Neuroinformatics, 2009, 7 : 191 - 194
  • [49] A linear tree edit distance algorithm for similar ordered trees
    Touzet, H
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2005, 3537 : 334 - 345
  • [50] Computing approximate tree edit distance using relaxation labeling
    Torsello, A
    Hancock, ER
    PATTERN RECOGNITION LETTERS, 2003, 24 (08) : 1089 - 1097
12345