【24h】

Induction of relational Fril rules

机译:关系弗里尔规则的归纳

获取原文

摘要

We propose an, approach to extend inductive logic programming (ILP) to cater for uncertainties in the form of probabilities and fuzzy sets. A corresponding decision tree induction algorithm that induces Fril (a support logic programming language) classification. Rules involving both forms of uncertainties is also described. This algorithm iteratively builds decision trees where each decision tree consists of one branch. This branch is directly translated into Fril rules that explain a part of the problem. The work presented focuses on propositional representations for both the input data values and the learned models. The approach is illustrated on the Pima Indian dataset. Finally an overview of the current work is given which deals with improving the algorithm with a new method for the calculation of support pairs and also with a new, user-independent stopping criterion for adding literals to the body of a rule.
机译:我们提出了一种扩展归纳逻辑编程(ILP)的方法,以概率和模糊集的形式满足不确定性。相应的决策树归纳算法,可归纳出Fril(一种支持逻辑编程语言)分类。还描述了涉及两种形式的不确定性的规则。该算法迭代地构建决策树,其中每个决策树都由一个分支组成。该分支直接转换为解释部分问题的Fril规则。提出的工作着重于针对输入数据值和学习模型的命题表示。该方法在Pima Indian数据集中进行了说明。最后,给出了当前工作的概述,该工作涉及使用一种新的支持对计算方法来改进算法,以及使用新的,与用户无关的停止准则来将文字添加到规则主体中。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号