Luc De Raedt, Hendrik Blockeel, Luc Dehaspe, Wim Van Laer  Home/Search
Context Related
| cs.kuleuven.ac.be/~dtai/p...36185.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/...2001E.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Three companion systems, Claudien, ICL and Tilde, are presented. They use a common representation for examples and hypotheses: each example is represented by a relational database. This contrasts with the classical inductive logic programming systems such as Progol and Foil. It is argued that this representation is closer to attribute value learning and hence more natural. Furthermore, the three systems can be considered first order upgrades of typical data mining systems, which induce... (Update)
Similar documents based on text: More All
0.4: Three Companions for First Order Data Mining - De Raedt, Blockeel, Dehaspe.. (1998) (Correct)
0.4: CLAUDIEN: The Clausal Discovery Engine User's Guide 3.0 - Dehaspe, Van Laer, De Raedt (1996) (Correct)
0.3: Distance Measures Between Atoms - Ramon, Van Laer, Bruynooghe (1998) (Correct)
BibTeX entry: (Update)
L. De Raedt, H. Blockeel, L. Dehaspe, and W. Van Laer. Three companions for data mining in first order logic. In S. Dieroski and N. Lavra, editors, Relational Data Mining, pages 105-139. Springer-Verlag, 2001. http://citeseer.ist.psu.edu/deraedt01three.html More
@incollection{ deraedt01three,
author = "Luc De Raedt and Hendrik Blockeel and Luc Dehaspe and Wim Van Laer",
title = "Three Companions for Data Mining in First Order Logic",
booktitle = "Relational Data Mining",
publisher = "Springer-Verlag",
editor = "Saso Dzeroski and Nada Lavrac",
isbn = "3-540-42289-7",
pages = "105--139",
year = "2001",
url = "citeseer.ist.psu.edu/deraedt01three.html" }
Citations (may not include all citations):2177 Programs for Machine Learning (context) - Quinlan - 1993
921 Mining association rules between sets of items in large data.. - Agrawal, Imielinski et al. - 1993
492 Learning logical definitions from relations (context) - Quinlan - 1990
400 Fast discovery of association rules (context) - Agrawal, Mannila et al. - 1996
392 A theory and methodology of inductive learning (context) - Michalski - 1983
85 Rule induction with CN2: Some recent improvements - Clark, Boswell - 1991
85 Theories for mutagenicity: A study in first-order and featur.. - Srinivasan, Muggleton et al. - 1996
69 Top-down induction of first order logical decision trees - Blockeel - 1998
69 Top-down induction of first order logical decision trees - Blockeel, De Raedt - 1998
67 Applications of inductive logic programming (context) - Bratko, Muggleton - 1995
55 Special issue on Inductive Logic Programming (context) - Muggleton, Progol et al. - 1995
43 Mining association rules in multiple relations - Dehaspe, De Raedt - 1997
38 Clausal discovery - De Raedt, Dehaspe - 1997
36 Pruning and grouping discovered association rules - Toivonen, Klemettinen et al. - 1995
29 Inductive constraint logic (context) - De Raedt, Van Laer - 1995
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2001-E.shtml): More
On Termination of Meta-Programs - Serebrenik (2001) (Correct)
Techniques for on- and Off-Line Specialisation of Logic Programs - Vanhoof (Correct)
On Termination of Meta-Programs - Serebrenik, De Schreye (2001) (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