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 条
  • [1] Approximating tree edit distance through string edit distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 90 - +
  • [2] Approximating Tree Edit Distance through String Edit Distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMICA, 2010, 57 (02) : 325 - 348
  • [3] Approximating Tree Edit Distance through String Edit Distance
    Tatsuya Akutsu
    Daiji Fukagawa
    Atsuhiro Takasu
    Algorithmica, 2010, 57 : 325 - 348
  • [4] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    FUNDAMENTA INFORMATICAE, 2010, 101 (03) : 157 - 171
  • [5] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 93 - +
  • [6] Tree edit distance with gaps
    Touzet, H
    INFORMATION PROCESSING LETTERS, 2003, 85 (03) : 123 - 129
  • [7] XML Information Retrieval through Tree Edit Distance and Structural Summaries
    Laitang, Cyril
    Boughanem, Mohand
    Pinel-Sauvagnat, Karen
    INFORMATION RETRIEVAL TECHNOLOGY, 2011, 7097 : 73 - 83
  • [8] A theory of subtree matching and tree kernels based on the edit distance concept
    Kilho Shin
    Annals of Mathematics and Artificial Intelligence, 2015, 75 : 419 - 460
  • [9] A theory of subtree matching and tree kernels based on the edit distance concept
    Shin, Kilho
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2015, 75 (3-4) : 419 - 460
  • [10] Tree edit distances from singularity theory
    Olsen, OF
    SCALE SPACE AND PDE METHODS IN COMPUTER VISION, PROCEEDINGS, 2005, 3459 : 316 - 326
12345