Learning probabilistic models of tree edit distance

DOI10.1016/J.PATCOG.2008.01.011zbMATH Open1151.68577OpenAlexW1979191353MaRDI QIDQ931691FDOQ931691

Authors Marc Bernard, Laurent Boyer, Amaury Habrard, Marc Sebban

Publication date 26 June 2008

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2008.01.011

zbMATH Keywords

EM algorithmgenerative modeltree edit distancediscriminative model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 2043356
• Learning stochastic edit distance: application in handwritten character recognition
• Efficient computation of the tree edit distance
• Automatic learning of cost functions for graph edit distance
• Metric learning for ordered labeled trees with \(pq\)-grams

Cites work

• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 1305084 (Why is no real title available?)
• A survey on tree edit distance and related problems
• Biological Sequence Analysis
• Decomposition algorithms for the tree edit distance problem
• Learning stochastic edit distance: application in handwritten character recognition
• RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The tree-to-tree editing problem

Cited in

(9)

• scientific article; zbMATH DE number 2043356 (Why is no real title available?)
• Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
• Good edit similarity learning by loss minimization
• Learning stochastic edit distance: application in handwritten character recognition
• Metric learning for ordered labeled trees with \(pq\)-grams
• A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer
• The graph matching problem
• Learning state machine-based string edit kernels
• Graph embedding using tree edit-union

This page was built for publication: Learning probabilistic models of tree edit distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931691)