Learning Structurally Indeterminate Clauses

This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of learning in structural domains. Structurally indeterminate clauses capture an important background knowledge in structural domains such as medicine, chemistry or computational linguistics: the specificity of the component/object relation. The REPART algorithm has been specifically developed to learn such clauses. Its efficiency lies in a particular change of representation so as to be able to use propositional learners. Because of the indeterminacy of the searched clauses the propositional learning problem to be solved is a kind of Multiple-Instance problem. Such reformulations may be a general approach for learning non determinate clauses in ILP. This paper presents original results discovered by REPART that exemplify how ILP algorithms may not only scale up efficiently to large relational databases but also discover useful and computationally hard-to-learn patterns.

[1]  Stephen Muggleton,et al.  Efficient Induction of Logic Programs , 1990, ALT.

[2]  Saso Dzeroski,et al.  PAC-learnability of determinate logic programs , 1992, COLT '92.

[3]  Ashwin Srinivasan,et al.  Mutagenesis: ILP experiments in a non-determinate biological domain , 1994 .

[4]  Jorg-uwe Kietz,et al.  Controlling the Complexity of Learning in Logic through Syntactic and Task-Oriented Models , 1992 .

[5]  Michael J. Pazzani,et al.  A Knowledge-intensive Approach to Learning Relational Concepts , 1991, ML.

[6]  Jean-Gabriel Ganascia,et al.  Relational Knowledge Discovery in a Chinese Character Database , 1998, Appl. Artif. Intell..

[7]  Thomas G. Dietterich,et al.  Solving the Multiple Instance Problem with Axis-Parallel Rectangles , 1997, Artif. Intell..

[8]  Michael J. Pazzani,et al.  Relational Clichés: Constraining Induction During Relational Learning , 1991, ML.

[9]  William W. Cohen.  Pac-Learning Nondeterminate Clauses , 1994, AAAI.

[10]  Saso Dzeroski,et al.  Inductive Logic Programming: Techniques and Applications , 1993 .

[11]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[12]  ProgramsWilliam W. CohenAT.  Learnability of Restricted Logic Programs , 1993 .

[13]  Ching Y. Suen,et al.  Computational analysis of Mandarin , 1979 .

[14]  Jean-Gabriel Ganascia.  CHARADE: A Rule System Learning System , 1987, IJCAI.

[15]  BiasWilliam W. CohenAT,et al.  Rapid Prototyping of ILP Systems Using Explicit Bias , 1993 .

[16]  Stefan Kramer,et al.  Stochastic Propositionalization of Non-determinate Background Knowledge , 1998, ILP.

[17]  Michèle Sebag,et al.  Tractable Induction and Classification in First Order Logic Via Stochastic Matching , 1997, IJCAI.