首页    期刊浏览 2025年02月21日 星期五
登录注册

文章基本信息

  • 标题:Elementary sets and declarative biases in a restricted gRS--ILP model
  • 本地全文:下载
  • 作者:Arul Siromoney
    ; Katsushi Inoue
  • 期刊名称:Informatica
  • 印刷版ISSN:1514-8327
  • 电子版ISSN:1854-3871
  • 出版年度:2000
  • 卷号:24
  • 期号:1.
  • 出版社:The Slovene Society Informatika, Ljubljana
  • 摘要:

    Rough set theory is a powerful model for imprecise information. Inductive logic programming (ILP) is a machine learning paradigm that learns from real world environments, where the information available is often imprecise. The rough setting in ILP describes the situation where the setting is imprecise and any induced logic program will not be able to distinguish between certain positive and negative examples. The gRS-ILP model (generic Rough Set Inductive Logic Programming model) provides a framework for ILP in a rough setting. The formal definitions of the gRS--ILP model and the theoretical foundation for definitive description in a rough setting are presented. Definitive description is the description of data with 100\% accuracy and is of use in the context of Knowledge Discovery from Databases. Several declarative biases and the formation of elementary sets in a restricted \mbox{gRS--ILP} model are then studied. An illustrative experiment of the definitive description of mutagenesis data using the ILP system Progol is presented.

  • 关键词:Rough Set Theory; Inductive Logic Programming; Machine Learning; Knowledge Discovery from Databases
国家哲学社会科学文献中心版权所有