Learning Metrics between Tree Structured Data: Application to Image Recognition

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

Contributor : Marc Sebban <>
Submitted on : Monday, July 30, 2007 - 3:37:51 PM
Last modification on : Wednesday, July 25, 2018 - 2:05:31 PM
Long-term archiving on : Friday, April 9, 2010 - 12:13:04 AM


Files produced by the author(s)


  • HAL Id : hal-00165954, version 1


Laurent Boyer, Amaury Habrard, Marc Sebban. Learning Metrics between Tree Structured Data: Application to Image Recognition. 18th European Conference on Machine Learning (ECML), Sep 2007, Warsaw, Poland. pp.54-66. ⟨hal-00165954⟩



Record views


Files downloads