Good edit similarity learning by loss minimization

DOI10.1007/s10994-012-5293-8zbMath1260.68187OpenAlexW1973309569MaRDI QIDQ1945121

Marc Sebban, Amaury Habrard, Aurélien Bellet

Publication date: 2 April 2013

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-012-5293-8

zbMATH Keywords

similarity learningedit distanceloss minimizationgood similarity function

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (3)

Online regularized learning with pairwise loss functions ⋮ Unnamed Item ⋮ Distance metric learning for graph structured data

Uses Software

• LMNN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• Learning probabilistic models of tree edit distance
• Learning state machine-based string edit kernels
• The tree-to-tree editing problem
• Learning stochastic edit distance: application in handwritten character recognition
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• On I-lacunary strong convergence in 2-normed spaces
• Relevant Representations for the Inference of Rational Stochastic Tree Languages
• 10.1162/153244302760200704
• Are Loss Functions All the Same?
• Learning Rational Stochastic Languages

This page was built for publication: Good edit similarity learning by loss minimization