2008年
Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets.
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS
- ,
- ,
- 巻
- 5278
- 号
- 開始ページ
- 98
- 終了ページ
- 110
- 記述言語
- 英語
- 掲載種別
- DOI
- 10.1007/978-3-540-88009-7_8
- 出版者・発行元
- SPRINGER-VERLAG BERLIN
In this paper, we study a learning procedure from positive data for bounded unions of certain class of languages. Our key tools are the notion of characteristic sets and hypergraphs. We generate hypergraphs from given positive data and exploit them in order to find characteristic sets.
- リンク情報
-
- DOI
- https://doi.org/10.1007/978-3-540-88009-7_8
- DBLP
- https://dblp.uni-trier.de/rec/conf/icgi/KamedaTY08
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000260043300008&DestApp=WOS_CPL
- URL
- https://dblp.uni-trier.de/conf/icgi/2008
- URL
- https://dblp.uni-trier.de/db/conf/icgi/icgi2008.html#KamedaTY08
- ID情報
-
- DOI : 10.1007/978-3-540-88009-7_8
- ISSN : 0302-9743
- DBLP ID : conf/icgi/KamedaTY08
- Web of Science ID : WOS:000260043300008