<テクニカルレポート>
Two Variations of Inductive Inference of Languages from Positive Data

作成者
本文言語
出版者
発行日
収録物名
出版タイプ
アクセス権
関連情報
概要 The present paper deals with the learnability of indexed families of uniformly recursive languages by single inductive inference machines (abbr. IIM) and teams of IIMs from positive and both positive ...and negative data. We study the learning power of single IIMs in dependence on the hypothesis space and the number of allowed anomalies the synthesized language may have. Our results are fourfold. First, we show that allowing anomalies does not increase the learning power as long as inference from positive and negative data is considered. Second, we establish an infinite hierarchy in the number of allowed anomalies for learning from positive data. Third, we prove that every learnable indexed family L may be even inferred with respect to the hypothesis space L itself. Fourth, we characterize learning with anomalies from positive data. Finally, we investigate the error correcting power of team learners, and relate the inference capabilities of teams in dependence on their size to one another. Again, an infinite hierarchy is established and the learnability is characterized in terms of recursively generable families of finite and non-empty sets.続きを見る

本文ファイル

105.ps tgz 115 KB 10  
105.ps.tar pdf 274 KB 139  

詳細

レコードID
査読有無
タイプ
登録日 2009.04.22
更新日 2018.08.31

この資料を見た人はこんな資料も見ています