Top-down induction of first-order logical decision trees

被引：324

作者：

Blockeel, H ^{[1
]}

De Raedt, L ^{[1
]}

机构：

[1] Katholieke Univ Leuven, Dept Comp Sci, B-3001 Heverlee, Belgium

来源：

ARTIFICIAL INTELLIGENCE | 1998年 / 101卷 / 1-2期

关键词：

D O I：

10.1016/S0004-3702(98)00034-4

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A first-order framework for top-down induction of logical decision trees is introduced. The expressivity of these trees is shown to be larger than that of the flat logic programs which are typically induced by classical ILP systems, and equal to that of first-order decision lists. These results are related to predicate invention and mixed variable quantification. Finally, an implementation of this framework, the TILDE system, is presented and empirically evaluated. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：285 / 297

页数：13

共 34 条

[1] [Anonymous], NEW GENERATION COMPU
[2] [Anonymous], 1993, P 13 INT JOINT C ART
[3] BAIN M, 1992, INDUCTIVE LOGIC PROG, P145
[4] BERGADANO F, 1988, P 5 INT WORKSH MACH
[5] BLOCKEEL H, 1997, P 7 INT WORKSH IND L, V1297
[6] BOSTROM H, 1995, P 14 INT JOINT C ART
[7] BRATKO I, 1990, PROLOG PROGRAMMING A
[8] Clark P., 1989, Machine Learning, V3, P261, DOI 10.1023/A:1022641700528
[9] FIRST-ORDER JK-CLAUSAL THEORIES ARE PAC-LEARNABLE
DERAEDT, L
DZEROSKI, S
[J]. ARTIFICIAL INTELLIGENCE, 1994, 70 (1-2) : 375 - 392
[10] DERAEDT L, 1997, P 7 INT WORKSH IND L, V1297, P133

← 1 2 3 4 →