106 articles – 48 references  [version française]
HAL: hal-00165954, version 1

Short view  Export this paper
Learning Metrics between Tree Structured Data: Application to Image Recognition
Boyer L., Habrard A., Sebban M.
in Proceedings of the 18th European Conference on Machine Learning (ECML) - 18th European Conference on Machine Learning (ECML), Warsaw : Poland (2007) - http://hal.archives-ouvertes.fr/hal-00165954
Conference proceedings
Computer Science/Learning
Learning Metrics between Tree Structured Data: Application to Image Recognition
Laurent Boyer () 1, Amaury Habrard () 2, Marc Sebban () 1
1:  LAboratoire Hubert Curien (LAHC)
http://laboratoirehubertcurien.fr
CNRS : UMR5516 – Université Jean Monnet - Saint-Etienne
18 rue du Professeur Lauras 42000 SAINT-ETIENNE
France
2:  Laboratoire d'informatique Fondamentale de Marseille (LIF)
http://www.lif.univ-mrs.fr/
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I
CMI 39, Rue Joliot Curie 13453 MARSEILLE CEDEX 13
France
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.
English

Proceedings of the 18th European Conference on Machine Learning (ECML)
international
2007-09-17
LNAI 4701
54-66
Springer
Lecture Notes in Computer Science

18th European Conference on Machine Learning (ECML)
2007-09-17
Warsaw
Poland

tree edit distance – EM algorithm

Pump-Priming PASCAL, Network of Excellence
Project Id ANR-05-MMSA-0016
Year 2005
Project acronyme marmota
Project title Apprentissage automatique, modèles probabilistes et langages d'arbres
Intitule Masse de données : Modélisation, Simulation, Applications
Acronyme MMSA
Attached file list to this document: 
PDF
ecml2007.pdf(203.7 KB)