(Enter summary)
Abstract: Many well-known learning systems like CN2 and C4.5 use an attributevalue
representation for the examples. In Inductive Logic Programming
(ILP) a first-order logical formalism is used, which is a more expressive
representation. We will introduce a 5-step methodology to upgrade an
existing propositional learner towards a first-order learning system. The
system ICL (Inductive Classification Logic) is used as a case study.
Keywords: inductive logic programming, propositional learning,... (Update)
Similar documents based on text: More All
0.7: How to Upgrade Propositional Learners to First Order Logic: .. - Van Laer, De Raedt (2001)
(Correct)
0.4: From Propositional to First Order Logic in Machine Learning and.. - Van Laer (2002)
(Correct)
0.3: Application of Graph-Based Concept Learning to the.. - Gonzalez, Holder, Cook (2001)
(Correct)
Related documents from co-citation: More All
2: Applications of inductive logic programming (context) - Bratko, Muggleton - 1995
2: Top-down induction of first order logical decision trees
- Blockeel, De Raedt - 1998
2: Relational reinforcement learning (context) - Deroski, De Raedt et al. - 2001
BibTeX entry: (Update)
W. Van Laer and L. De Raedt. A methodo- logy for first order learning: a case study. In F. Verdenius and W. van den Broek, editors, Proceedings of the Eighth Belgian-Dutch Conference on Machine Learning, volume 352 of ATO-DLO Rapport, 1998. http://citeseer.ist.psu.edu/vanlaer98methodology.html More
@inproceedings{ vanlaer98methodology,
author = "Wim Van Laer and Luc De Raedt",
title = "A methodology for first order learning : a case study",
booktitle = "Eighth Belgian-Dutch Conference on Machine Learning",
publisher = "ATO-DLO",
editor = "F. Verdenius and W. van den Broek",
pages = "105--113",
year = "1998",
url = "citeseer.ist.psu.edu/vanlaer98methodology.html" }
Citations (may not include all citations):
1359
Induction of decision trees (context) - Quinlan - 1986
400
Fast discovery of association rules (context) - Agrawal, Mannila et al. - 1996
392
A theory and methodology of inductive learning (context) - Michalski - 1983
313
Inductive logic programming : Theory and methods
- Muggleton, De Raedt - 1994
281
Programs for Machine Learning (context) - Quinlan - 1993
267
A note on inductive generalization (context) - Plotkin - 1970
213
A maximum entropy approach to natural language processing
- Berger, Pietra et al. - 1996
149
New Generation Computing (context) - Muggleton, Progol - 1995
85
Rule induction with CN2: Some recent improvements
- Clark, Boswell - 1991
67
Applications of inductive logic programming (context) - Bratko, Muggleton - 1995
43
Mining association rules in multiple relations
- Dehaspe, De Raedt - 1997
38
Clausal discovery
- De Raedt, Dehaspe - 1997
29
Inductive constraint logic (context) - De Raedt, Van Laer - 1995
28
Machine Learning (context) - Clark, Niblett et al. - 1989
25
First order jk-clausal theories are PAClearnable (context) - De Raedt, Dzeroski - 1994
13
Experiments with top-down induction of logical decision tree.. (context) - Blockeel, De Raedt - 1997
13
Maximum entropy modeling with clausal constraints
- Dehaspe - 1997
3
Induction in logic (context) - De Raedt - 1996
3
Inductive constraint logic and the mutagenesis problem
- Van Laer, Blockeel et al. - 1996
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/1998-E.shtml): More
Creating Specialised Integrity Checks Through Partial.. - Leuschel, De Schreye (1998)
(Correct)
Semantics-Based Program Analysis for Logic-Based Languages .. - Codish, Demoen, Sagonas (1998)
(Correct)
Detecting Unsolvable Queries for Definite Logic Programs - Bruynooghe.. (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC