Learning Stochastic Tree Edit Distance

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

Cited literature [11 references]  Display  Hide  Download

https://hal-ujm.archives-ouvertes.fr/ujm-00109696
Contributor : Marc Bernard <>
Submitted on : Thursday, November 16, 2006 - 11:47:54 AM
Last modification on : Wednesday, November 20, 2019 - 2:57:14 AM
Long-term archiving on: Tuesday, April 6, 2010 - 8:56:26 PM

Identifiers

  • HAL Id : ujm-00109696, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

191

Files downloads

321