Condensed Representations for Inductive Logic Programming
Condensed Representations for Inductive Logic Programming
复制标题
归纳逻辑编程的压缩表示
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
J. Ramon
中科院分区：
文献类型：
--
作者：
L. D. Raedt;J. Ramon
当挖掘频繁的Datalog查询时，许多查询将覆盖相同的示例；即，它们是等价的，因此是多余的。这些等价性可能是由于数据集或背景理论中指定的规律造成的。为了避免生成冗余子句，我们引入了各种类型的压缩表示。更具体地说，我们引入了 δ-free 和闭合子句，它们是用 w.r.t 定义的。数据集以及语义自由和封闭的子句，考虑到逻辑背景理论。还提出了一种采用这些表示的新颖算法，并针对归纳逻辑编程中的许多基准问题进行了实验评估。
When mining frequent Datalog queries, many queries will cover the same examples; i.e., they will be equivalent and hence, redundant. The equivalences can be due to the data set or to the regularities specified in the background theory. To avoid the generation of redundant clauses, we introduce various types of condensed representations. More specifically, we introduce δ-free and closed clauses, that are defined w.r.t. the data set, and semantically free and closed clauses, that take into account a logical background theory. A novel algorithm that employs these representations is also presented and experimentally evaluated on a number of benchmark problems in inductive logic programming.