1994
DOI: 10.1016/0743-1066(94)90035-3
|View full text |Cite
|
Sign up to set email alerts
|

Inductive Logic Programming: Theory and methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
723
0
20

Year Published

1998
1998
2014
2014

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 1,130 publications
(745 citation statements)
references
References 35 publications
2
723
0
20
Order By: Relevance
“…They constitute the model of the relations. Rather than encoding these rules manually we learn them from examples of data using Inductive Logic Programming (ILP) methods [15]. Typically ILP methods use a top-down approach of refining a very general rule, where the refining process involves adding a body predicate one at a time with the purpose of "better fitting" the given training examples, i.e., eliminate negative examples while still maintaining the coverage of positive examples.…”
Section: Technical Preliminaries and Overviewmentioning
confidence: 99%
See 1 more Smart Citation
“…They constitute the model of the relations. Rather than encoding these rules manually we learn them from examples of data using Inductive Logic Programming (ILP) methods [15]. Typically ILP methods use a top-down approach of refining a very general rule, where the refining process involves adding a body predicate one at a time with the purpose of "better fitting" the given training examples, i.e., eliminate negative examples while still maintaining the coverage of positive examples.…”
Section: Technical Preliminaries and Overviewmentioning
confidence: 99%
“…The added predicates can be base predicates, previously learned predicates, or arithmetic constraints (such as |X-Y| < δ). ILP methods have produced impressive practical results (see e.g., [15] and are now well established as mainstream machine learning technology. The strength of ILP methods is that learning is done in the presence of prior background knowledge encoded as facts.…”
Section: Technical Preliminaries and Overviewmentioning
confidence: 99%
“…Given an encoding of the known background knowledge and a set of examples represented as a logical database of facts, an ILP system will derive a hypothesized logic program which entails all the positive and none of the negative examples [22]. Inductive logic programming is particularly useful in bioinformatics and natural language processing [23]. The term inductive logic programming was first introduced in a paper by Stephen Muggleton [22].…”
Section: Taxonomy Of Supervised Learning Algorithmsmentioning
confidence: 99%
“…-Being based on logic programming, it can build on the successes of inductive logic programming [Muggleton and De Raedt, 1994;Quinlan and Cameron-Jones, 1995;Muggleton, 1995]. The fact that parts of ICL theories are logic programs should aid in this effort.…”
Section: Icl and Learningmentioning
confidence: 99%