Query Induction with Schema-Guided Pruning Strategies - Archive ouverte HAL Access content directly
Journal Articles Journal of Machine Learning Research Year : 2013

Query Induction with Schema-Guided Pruning Strategies

(1) , (2) , (3) , (1)
Joachim Niehren
Rémi Gilleron
Aurélien Lemay
  • Function : Author
  • PersonId : 834816


Inference algorithms for tree automata that define node selecting queries in unranked trees rely on tree pruning strategies. These impose additional assumptions on node selection that are needed to compensate for small numbers of annotated examples. Pruning-based heuristics in query learning algorithms for Web information extraction often boost the learning quality and speed up the learning process. We will distinguish the class of regular queries that are stable under a given schema-guided pruning strategy, and show that this class is learnable with polynomial time and data. Our learning algorithm is obtained by adding pruning heuristics to the traditional learning algorithm for tree automata from positive and negative examples. While justified by a formal learning model, our learning algorithm for stable queries also performs very well in practice of XML information extraction.
Fichier principal
Vignette du fichier
0.pdf (765.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00607121 , version 1 (17-01-2013)
inria-00607121 , version 2 (29-03-2013)


  • HAL Id : inria-00607121 , version 2


Joachim Niehren, Jérôme Champavère, Rémi Gilleron, Aurélien Lemay. Query Induction with Schema-Guided Pruning Strategies. Journal of Machine Learning Research, 2013, 14 (1), pp.927−964. ⟨inria-00607121v2⟩
314 View
147 Download


Gmail Facebook Twitter LinkedIn More