Learning probabilistic models of tree edit distance

DOI10.1016/j.patcog.2008.01.011zbMath1151.68577OpenAlexW1979191353MaRDI QIDQ931691

Laurent Boyer, Amaury Habrard, Marc Bernard, 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)

Related Items (3)

Good edit similarity learning by loss minimization ⋮ The graph matching problem ⋮ Learning state machine-based string edit kernels

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• The tree-to-tree editing problem
• RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
• Learning stochastic edit distance: application in handwritten character recognition
• Decomposition algorithms for the tree edit distance problem
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Biological Sequence Analysis

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