
[ ILPnet2 | Library | Newsletter | CSCW | Education | End-User Club | Events | Nodes | Systems | Applications | Members only ]
Three Companions for Data Mining in First Order Logic
Luc De Raedt,
Hendrik Blockeel,
Luc Dehaspe,
and Wim Van Laer.
In Saso Dzeroski
and Nada Lavrac, editors, Relational Data Mining,
pages 105--139. Springer-Verlag, September 2001. More behind this link.
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 association rules,
classification rules or decision trees respectively.
BibTeX entry.
Other publications
L De Raedt,
Luc.DeRaedt@cs.kuleuven.ac.be,
H Blockeel,
hendrik@cs.kuleuven.ac.be,
L Dehaspe,
ldh@cs.kuleuven.ac.be,
Wim Van Laer,
Wim.VanLaer@cs.kuleuven.ac.be. Last modified on Wednesday 9 April 2003 at 18:31. © 2003 ILPnet2