<テクニカルレポート>
Efficient Learning of Semi-structured Data from Queries

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 This paper studies the learning complexity of classes of structured patterns for HTML/ XML-trees in the query learning framework of Angluin. We present polynomial time learning algorithms for ordered ...gapped tree patterns, OGT, and ordered gapped forests, OGF, under the into-matching semantics using equivalence queries and subset queries. As a corollary, the learnability with equivalence and membership queries is also presented. This work extends the recent results on the query learning for ordered forests under onto-matching semantics by Arimura et al. (1997), for unordered forests under into-matching semantics by Amoth, Cull, Tadepalli (1999), and for regular string patterns by Matsumoto and Shinohara (1997).続きを見る

本文情報を非表示

trcs191.ps gz 90.5 KB 58  
trcs191 pdf 256 KB 40  

詳細

レコードID
査読有無
関連情報
主題
タイプ
登録日 2007.04.21
更新日 2017.01.20