Refutability and Reliability for Inductive Inference of Recursive Real-Valued Functions

• Hirowatari Eiju

  Department of Business Administration, The University of Kitakyushu

• Hirata Kouichi

  Department of Artificial Intelligence, Kyushu Institute of Technology

• Miyahara Tetsuhiro

  Faculty of Information Sciences, Hiroshima City University

• Arikawa Setsuo

  Department of Informatics, Kyushu University

抄録

Inductive inference gives us a theoretical model of concept learning from examples. In this paper, we study refutably and reliably inductive inference of recursive real-valued functions. First we introduce the new criteria RealRefEx for refutable inference and RealRelEx for reliable inference. Then, we compare these two criteria with RealEx for identification in the limit, RealFin for learning finitely and RealNum¡ for learning by enumeration that have been already introduced in the previous works, and investigate their interaction. In particular, we show that RealRefEx and RealRelEx are closed under union, as similar as the criteria RefEx and RelEx for inductive inference of recursive functions.

収録刊行物

• Information and Media Technologies

  Information and Media Technologies 1 (1), 33-44, 2006

  Information and Media Technologies 編集運営会議

詳細情報

• CRID: 1390001205265244416
• NII論文ID: 130000058390
• DOI: 10.11185/imt.1.33
• ISSN: 18810896
• 本文言語コード: en
• データソース種別:
  • JaLC
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可