HAL: hal-00165954, version 1

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

18th European Conference on Machine Learning (ECML), Warsaw : Pologne (2007)

Learning Metrics between Tree Structured Data: Application to Image Recognition

Laurent Boyer 1, Amaury Habrard 2, Marc Sebban 1

(2007-09-17)

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.

1:	LAboratoire Hubert Curien (LAHC)
	CNRS : UMR5516 – Université Jean Monnet - Saint-Etienne
2:	Laboratoire d'informatique Fondamentale de Marseille (LIF)
	CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I

Subject

:

Computer Science/Learning

Keyword(s): tree edit distance – EM algorithm

hal-00165954, version 1

http://hal.archives-ouvertes.fr/hal-00165954

oai:hal.archives-ouvertes.fr:hal-00165954

From: Marc Sebban <>

Submitted on: Monday, 30 July 2007 15:37:51

Updated on: Friday, 9 January 2009 08:26:33