Improving the efficiency of inductive logic programming through the use of query packs

被引:59
作者
Blockeel, H
Dehaspe, L
Demoen, B
Janssens, G
Ramon, J
Vandecasteele, H
机构
[1] Katholieke Univ Leuven, Dept Comp Sci, B-3001 Louvain, Belgium
[2] PharmaDM, B-3001 Louvain, Belgium
关键词
D O I
10.1613/jair.924
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficiency of ILP systems must improve substantially. To this end, the notion of a query pack is introduced: it structures sets of similar queries. Furthermore, a mechanism is described for executing such query packs. A complexity analysis shows that considerable efficiency improvements can be achieved through the use of this query pack execution mechanism. This claim is supported by empirical results obtained by incorporating support for query pack execution in two existing learning systems.
引用
收藏
页码:135 / 166
页数:32
相关论文
共 33 条
[1]  
Agrawal R., 1996, Advances in Knowledge Discovery and Data Mining, P307
[2]  
AITKACI H, 1991, WARRENS ABSTRACT MAC
[3]  
[Anonymous], P 15 INT C MACH LEAR
[4]   Top-down induction of first-order logical decision trees [J].
Blockeel, H ;
De Raedt, L .
ARTIFICIAL INTELLIGENCE, 1998, 101 (1-2) :285-297
[5]   Scaling up inductive logic programming by learning from interpretations [J].
Blockeel, H ;
de Raedt, L ;
Jacobs, N ;
Demoen, B .
DATA MINING AND KNOWLEDGE DISCOVERY, 1999, 3 (01) :59-93
[6]  
BLOCKEEL H, 2000, 10 INT C IND LOG PRO, P43
[7]  
BLOCKEEL H, 1997, LECT NOTES ARTIF INT, V1297, P77
[8]  
Blockeel H, 1998, THESIS KATHOLIEKE U
[9]  
Bongard M. M., 1970, PATTERN RECOGNITION
[10]  
BRATKO I, 1990, PROLOG PROGRAMMING A