Learning Stochastic Tree Edit Distance - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Learning Stochastic Tree Edit Distance

(1) , (2) , (1)


Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured documents. In this context, many applications require the calculation of similarities between tree pairs. The most studied distance is likely the tree edit distance for which improvements in terms of complexity have been achieved during the last decade. However, this classic edit distance usually uses a priori fixed edit costs which are often difficult to tune, that leaves little room for tackling complex problems. In this paper, we focus on the learning of a stochastic tree edit distance. We use an adaptation of the expectation-maximization algorithm for learning the primitive edit costs. We carried out several series of experiments that confirm the interest to learn a tree edit distance rather than a priori imposing edit costs.
Fichier principal
Vignette du fichier
bernard_habrard_sebban_ecml_2006.pdf (166.79 Ko) Télécharger le fichier

Dates and versions

ujm-00109696 , version 1 (16-11-2006)


  • HAL Id : ujm-00109696 , version 1


Marc Bernard, Amaury Habrard, Marc Sebban. Learning Stochastic Tree Edit Distance. 17th European Conference on Machine Learning, Sep 2006, Berlin, Germany. pp.42-53. ⟨ujm-00109696⟩
116 View
188 Download


Gmail Facebook Twitter LinkedIn More