Sciweavers

Share
ECML
2007
Springer

Learning Metrics Between Tree Structured Data: Application to Image Recognition

9 years 8 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some approaches focused on the learning of edit probabilities required to compute a so-called stochastic tree edit distance. However, to reduce the algorithmic and learning constraints, the deletion and insertion operations are achieved on entire subtrees rather than on single nodes. We aim in this article at filling the gap with the learning of a more general stochastic tree edit distance where node deletions and insertions are allowed. Our approach is based on an adaptation of the EM optimization algorithm to learn parameters of a tree model. We propose an original experimental approach aiming at representing images by a tree-structured representation and then at using our learned metric in an image recognition task. Comparisons with a non learned tree edit distance confirm the effectiveness of our approach.
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where ECML
Authors Laurent Boyer 0002, Amaury Habrard, Marc Sebban
Comments (0)
books