Learning probabilistic models of tree edit distance
From MaRDI portal
Publication:931691
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Title not available (Why is that?)
- Biological Sequence Analysis
- A survey on tree edit distance and related problems
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Decomposition algorithms for the tree edit distance problem
- Title not available (Why is that?)
- The tree-to-tree editing problem
- Learning stochastic edit distance: application in handwritten character recognition
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
Cited In (9)
- Learning stochastic edit distance: application in handwritten character recognition
- Learning state machine-based string edit kernels
- Graph embedding using tree edit-union
- Title not available (Why is that?)
- A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer
- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
- Good edit similarity learning by loss minimization
- Metric learning for ordered labeled trees with \(pq\)-grams
- The graph matching problem
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)
