Learning an approximation to inductive logic programming clause evaluation

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3194, Issue , 2004, Pages 80-97

  Dimaio, Frank ^a   Shavlik, Jude ^a  

^a University of Wisconsin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA MINING; INFORMATION RETRIEVAL; LEARNING SYSTEMS; MOLECULAR BIOLOGY; RELATIONAL DATABASE SYSTEMS; STOCHASTIC PROGRAMMING; ALGORITHMS; APPROXIMATION ALGORITHMS; COMPUTATION THEORY; FUNCTION EVALUATION; LOGIC PROGRAMMING; STOCHASTIC SYSTEMS;

INDUCTIVE LOGIC PROGRAMMING (ILP); INFORMATION EXTRACTION; RAPID RANDOM RESTARTS (RRR); STOCHASTIC CLAUSE SELECTION (SCS); BENCHMARK DATASETS; EVALUATION ALGORITHM; EVALUATION FUNCTION; HYPOTHESIS EVALUATION; RANDOMIZED SEARCH; RAPID RANDOM RESTARTS; STOCHASTIC CLAUSE SELECTIONS; TRAINING DATA;

LOGIC PROGRAMMING; INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 22944431848     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30109-7_10     Document Type: Conference Paper

References (32)

1. N. Lavrac & S. Dzeroski (1994). Inductive Logic Programming. Ellis Horwood.
2. R. King, S. Muggleton & M. Sternberg (1992). Predicting protein secondary structure using inductive logic programming. Protein Engineering, 5:647-657.
3. A. Srinivasan, R. King, S. Muggleton & M. Stemberg (1997). The predictive toxicology evaluation challenge. Proc. 15th Intl. Joint Conf. on Artificial Intelligence, 1-6.
4. B. Dolsak & S. Muggleton (1991). The application of ILP to finite element mesh design. Proc. 1st Intl. Workshop on ILP, 225-242.
5. J. Zelle & R. Mooney (1993). Learning semantic grammars with constructive inductive logic programming. Proc. 11th Natl. Conf. on Artificial Intelligence, 817-822.
6. I. Bratko & M. Grobelnik (1993). Inductive learning applied to program construction and verification. Proc. 3rd Intl. Workshop on Inductive Logic Programming, 169-182.
7. S. Nienhuys-Cheng & R. de Wolf (1997). Foundations of Inductive Logic Programming. Springer-Verlag.
8. M. Schmidt-Schauss (1988). Implication of clauses is undecidable. Theoretical Computer Science, 59:287-296.
9. J. Quinlan (1990). Learning logical definitions from relations. Machine Learning, 239-266.
10. S. Muggleton & C. Feng (1990). Efficient induction of logic programs. Proc. 1st Conf. on Algorithmic Learning Theory, 368-381.
11. S. Muggleton (1995). Inverse Entailment and Progol. New Generation Computing, 13:245-286.
12. A. Srinivasan (2000). A study of two probabilistic methods for searching large spaces with ILP. Tech. Report PRG-TR-16-00. Oxford Univ. Computing Lab.
13. F. Zelezny, A. Srinivasan & D. Page (2002). Lattice-search runtime distributions may be heavy-tailed. Proc. 12th Intl. Conf. on Inductive Logic Programming, 333-345.
14. A. Giordana, L. Saitta & F. Zini (1994). Learning disjunctive concepts by means of genetic algorithms. Proc. 11th Intl. Conf. on Machine Learning, 96-104.
15. P. Hanschke & J. Wurtz (1993). Satisfiability of the smallest binary program. Info. Proc. Letters, 496:237-241.
16. E. Dantsin, T. Eiter, G. Gottlob & A. Voronkov (2001). Complexity and expressive power of logic programming. ACM Computing Surveys, 33:374-425.
17. U. Rückert & S. Kramer (2003). Stochastic local search in k-term DNF learning. Proc. 20th Intl. Conf. on Machine Learning, 648-655.
18. H. Blocked, L. Dehasp, B. Demoen, G. Janssens, J. Ramon & H. Vandecasteele (2002). Improving the efficiency of inductive logic programming through the use of query packs. J. AI Research, 16:135-166.
19. V. Santos Costa, A. Srinivasan, R. Camacho, H. Blockeel, B. Demoen, G. Janssens, J. Struyf, H. Vandecasteele & W. Van Laer (2003). Query transformations for improving the efficiency of ILP systems, J. Machine Learning Research, 4:465-491.
20. A. Srinivasan (1999). A study of two sampling methods for analysing large datasets with ILP. Data Mining and Knowledge Discovery, 3:95-123.
21. M. Sebag & C. Rouveirol (2000). Resource-bounded relational reasoning: induction and deduction through stochastic matching. Machine Learning, 38:41-62.
22. J. Maloberti & M. Sebag (2001). Theta-subsumption in a constraint satisfaction perspective. Proc. 11th Intl. Conf. on Inductive Logic Programming, 164-178.
23. J. Boyan & A. Moore (2000). Learning evaluation functions to improve optimization by local search. J. Machine Learning Research, 1:77-112.
24. K. Hornik, M. Stinchcombe & H. White (1989). Multilayer feedforward networks are universal approximators. Neural Networks, 2:359-366.
25. D. Nix & A. Weigend (1995). Learning local error bars for nonlinear regression. Advances in Neural Information Processing Systems. MIT Press.
26. M. Craven & J. Shavlik (1995). Extracting tree-structured representations of trained networks. Advances in Neural Information Processing Systems. MIT Press.
27. R. King, S. Muggleton, A. Srinivasan & M. Sternberg (1996). Structure-activity relationships derived by machine learning. PNAS, 93:438-442.
28. A. Srinivasan, R. King, S. Muggleton & M. Stemberg (1997). Carcinogenesis predictions using ILP. Proc. 7th Intl. Workshop on Inductive Logic Programming, 273-287.
29. I. Witten & E. Frank (1999). Data Mining. Morgan Kaufmann Publishers.
30. M. Goadrich, L. Oliphant & J. Shavlik (2004). Learning ensembles of first-order clauses for recall-precision curves: a case study in biomedical information extraction. Proc. 14th Intl. Conf. on Inductive Logic Programming.
31. M. Botta, A. Giordana, L. Saitta & M. Sebag (2003). Relational learning as search in a critical region. J. Machine Learning Research, 4:431-463.
32. R. Caruana & S. Baluja (1996). Using the future to 'sort out' the present. Advances in Neural Information Processing Systems. MIT Press.