首页    期刊浏览 2024年12月12日 星期四
登录注册

文章基本信息

  • 标题:Relational Knowledge Extraction from Attribute-Value Learners
  • 作者:Manoel V. M. Fran{\c{c}}a ; Artur S. D. Garcez ; Gerson Zaverucha
  • 期刊名称:OASIcs : OpenAccess Series in Informatics
  • 电子版ISSN:2190-6807
  • 出版年度:2013
  • 卷号:35
  • 页码:35-42
  • DOI:10.4230/OASIcs.ICCSW.2013.35
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Bottom Clause Propositionalization (BCP) is a recent propositionalization method which allows fast relational learning. Propositional learners can use BCP to obtain accuracy results comparable with Inductive Logic Programming (ILP) learners. However, differently from ILP learners, what has been learned cannot normally be represented in first-order logic. In this paper, we propose an approach and introduce a novel algorithm for extraction of first-order rules from propositional rule learners, when dealing with data propositionalized with BCP. A theorem then shows that the extracted first-order rules are consistent with their propositional version. The algorithm was evaluated using the rule learner RIPPER, although it can be applied on any propositional rule learner. Initial results show that the accuracies of both RIPPER and the extracted first-order rules can be comparable to those obtained by Aleph (a traditional ILP system), but our approach is considerably faster (obtaining speed-ups of over an order of magnitude), generating a compact rule set with at least the same representation power as standard ILP learners.
  • 关键词:Relational Learning; Propositionalization; Knowledge Extraction
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有