Tree edit distance from information theory

Authors:
Andrea Torsello;Edwin R. Hancock
Affiliations:
Dept. of Computer Science, University of York, Heslington, York, UK;Dept. of Computer Science, University of York, Heslington, York, UK
Venue:
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Year:
2003

Citing 12
Cited 0

An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean and maximum common subgraph of two graphs

Pattern Recognition Letters
Bayesian Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Modal Matching for Correspondence and Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching in Computer Vision Using Probabilistic Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching and Embedding through Edit-Union of Trees

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Learning Probabilistic Models of Relational Structure

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
String Edit Distance, Random Walks and Graph Matching

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Computing approximate tree edit distance using relaxation labeling

Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Being Bayesian about network structure

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.