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 条

[31] Clustering of Synthetic Routes Using Tree Edit Distance
Genheden, Samuel
Engkvist, Ola
Bjerrum, Esben
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2021, 61 (08) : 3899 - 3907
[32] Phylogenetic tree reconstruction based on normalized edit distance
Li, Yu-Jian
Wang, Fang-Yuan
Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology, 2008, 34 (11): : 1211 - 1215
[33] Computing Text Similarity using Tree Edit Distance
Sidorov, Grigori
Gomez-Adorno, Helena
Markov, Ilia
Pinto, David
Loya, Nahun
2015 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY DIGIPEN NAFIPS 2015, 2015,
[34] TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE
Yamamoto, Yoshiyuki
Hirata, Kouichi
Kuboyama, Tetsuji
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (03) : 307 - 329
[35] Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance
Mao, Xiao
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 792 - 803
[36] Tree Edit Distance as a Baseline Approach for Paraphrase Representation
Vila, Marta
Dras, Mark
PROCESAMIENTO DEL LENGUAJE NATURAL, 2012, (48): : 89 - 95
[37] Tree edit distance: Robust and memory-efficient
Pawlik, Mateusz
Augsten, Nikolaus
INFORMATION SYSTEMS, 2016, 56 : 157 - 173
[38] Extend tree edit distance for effective object identification
Yue Wang
Hongzhi Wang
Liyan Zhang
Yang Wang
Jianzhong Li
Hong Gao
Knowledge and Information Systems, 2016, 46 : 629 - 656
[39] Tree Edit Distance Problems: Algorithms and Applications to Bioinformatics
Akutsu, Tatsuya
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (02): : 208 - 218
[40] An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs
Paassen, Benjamin
SIMILARITY SEARCH AND APPLICATIONS, SISAP 2021, 2021, 13058 : 364 - 371

← 1 2 3 4 5 →