Skip to Main content Skip to Navigation
Conference papers

Learning Structurally Indeterminate Clauses

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Monday, October 16, 2017 - 3:01:51 PM
Last modification on : Friday, December 13, 2019 - 11:44:05 AM

Links full text



Jean-Daniel Zucker, Jean-Gabriel Ganascia. Learning Structurally Indeterminate Clauses. The Eighth International Conference on Inductive Logic Programming, Jul 1998, Madison, Wisconsin, United States. pp.235-244, ⟨10.1007/BFb0027327⟩. ⟨hal-01617367⟩



Record views