Relational Data Mining 2001
DOI: 10.1007/978-3-662-04599-2_10
|View full text |Cite
|
Sign up to set email alerts
|

How to Upgrade Propositional Learners to First Order Logic: A Case Study

Abstract: We describe a methodology for upgrading existing attribute value learners towards rst order logic. This method has several advantages: one can pro t from existing research on propositional learners (and inherit its e ciency and e ectiveness), relational learners (and inherit its expressiveness) and PAC-learning (and inherit its theoretical basis). Moreover there is a clear relationship between the new relational system and its propositional counterpart. This makes the ILP system easy to use and understand by u… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2001
2001
2017
2017

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 24 publications
(20 citation statements)
references
References 28 publications
0
20
0
Order By: Relevance
“…Most statistical relational learning algorithms come from the field of inductive logic programming (ILP) [41] and derivatives. ILP systems dealing with classification tasks typically adopt the covering approach of rule induction systems [63]. ILP suffers from the high computational complexity of the task because the algorithm has to search all the relations and all the relationships between the relations [30].…”
Section: Statistical Relational Learningmentioning
confidence: 99%
“…Most statistical relational learning algorithms come from the field of inductive logic programming (ILP) [41] and derivatives. ILP systems dealing with classification tasks typically adopt the covering approach of rule induction systems [63]. ILP suffers from the high computational complexity of the task because the algorithm has to search all the relations and all the relationships between the relations [30].…”
Section: Statistical Relational Learningmentioning
confidence: 99%
“…We thus have algorithms for first order logical decision tree induction , relational distance-based clustering and prediction (Kirsten, Wrobel, and Horvath, 2001), and relational reinforcement learning (Džeroski, De Raedt, and Blockeel, 1998;Džeroski, De Raedt, and Driessens, 2001), to name a few. There is even a generic recipe for upgrading propositional learning approaches to relational settings (Van Laer and De Raedt, 2001), which involves upgrading the key notions of the propositional learner. For example, to obtain a relational distance-based approach, we need to upgrade a propositional distance measure to a relational one.…”
Section: Relational Learningmentioning
confidence: 99%
“…Relational patterns can be expressed not only in SQL, but also in first-order logic (or predicate calculus), which explains why many MRDM algorithms originate from the field of inductive logic programming (ILP) (Muggleton, 1992;De Raedt, 1992;Lǎvrac and Džeroski, 1994). Upgrading a classical data mining algorithm devised for double-entry tabular data to a relational setting is not a trivial task (Van Laer and De Raedt, 2001). For instance, it may be necessary to extend the definition of distance measure to data distributed among several tables.…”
Section: Examplementioning
confidence: 99%