2006年
Inferability of Closed Set Systems from Positive Data.
NEW FRONTIERS IN ARTIFICIAL INTELLIGENCE
- ,
- ,
- ,
- 巻
- 4384
- 号
- 開始ページ
- 265
- 終了ページ
- 275
- 記述言語
- 英語
- 掲載種別
- DOI
- 10.1007/978-3-540-69902-6_23
- 出版者・発行元
- SPRINGER-VERLAG BERLIN
In this paper, we generalize previous results showing connections between inductive inference from positive data and algebraic structures by using tools from universal algebra. In particular, we investigate the inferability from positive data of language classes defined by closure operators. We show that some important properties of language classes used in inductive inference correspond closely to commonly used properties of closed set systems. We also investigate the inferability of algebraic closed set systems, and show that these types of systems are inferable from positive data if and only if they contain no infinite ascending chain of closed sets. This generalizes previous results concerning the inferability of various algebraic classes such as the class of ideals of a ring. We also show the relationship with algebraic closed set systems and approximate identifiability as introduced by Kobayashi and Yokomori [11]. We propose that closure operators offer a unifying framework for various approaches to inductive inference from positive data.
- リンク情報
-
- DOI
- https://doi.org/10.1007/978-3-540-69902-6_23
- DBLP
- https://dblp.uni-trier.de/rec/conf/jsai/BrechtKTY06
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000244810000023&DestApp=WOS_CPL
- URL
- https://dblp.uni-trier.de/conf/jsai/2006
- URL
- https://dblp.uni-trier.de/db/conf/jsai/jsai2006.html#BrechtKTY06
- ID情報
-
- DOI : 10.1007/978-3-540-69902-6_23
- ISSN : 0302-9743
- DBLP ID : conf/jsai/BrechtKTY06
- Web of Science ID : WOS:000244810000023