Anytime Inductive Logic Programming

15th International Conference on Computers and Their Applications 2000, CATA 2000

Volumn , Issue , 2000, Pages 439-442

  Lindgren, Tony ^a  

^a STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; HEURISTIC ALGORITHMS;

ANYTIME ALGORITHM; ANYTIME SYSTEMS; BACKGROUND KNOWLEDGE; DIVIDE-AND-CONQUER; EXCEL; INFORMATION GAIN; PROGRAMMING ALGORITHMS; SIMPLE HEURISTICS; WINDOW SIZE;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 34748838248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Boström H. Covering vs. divide-and-conquer for top-down induction of logic programs. Proc. of the Fourteenth International Joint Conference on Artificial Intelligence, 1995.
2. Boström H. and Asker L. Combining divide-andconquer and separate-and-conquer for efficient and effective rule induction. Proceedings of the Ninth International Workshop on Inductive Logic Programming, 1999.
3. Stephen Muggleton and Luc de Raedt. Inductive logic programming: Theory and methods. The Journal of Logic Programming, 1994.
4. Shan-Hwei Nienhuys-Cheng and Ronald de Wolf. Foundations of Inductive Logic Programming. Springer-Verlag, 1997.
5. Dietterich G. Thomas. Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 1998.