Three Companions for Data Mining in First Order Logic
Published 1 January 2001
Luc De Raedt, Hendrik Blockeel, Luc De Raedt, Wim Van Laer
Citations35
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Three companion systems, CLAUDIEN, ICL and TILDE, are presented that use a common representation for examples and hypotheses: each example is represented by a relational database, which contrasts with the classical inductive logic programming systems.
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.
Keywords
Computer Science
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Machine LearningThe CN2 Induction Algorithm
2,015 Citations1989Peter Clark, Tim Niblett
A description and empirical evaluation of a new induction system, CN2, designed for the efficient induction of simple, comprehensible production rules in domains where problems of poor description language and/or noise may be present.
Machine LearningLearning Logical Definitions from Relations
1,425 Citations1990J. R. Quinlan
FOIL is a system that learns Horn clauses from data expressed as relations, but extends them to a first-order formalism, which has been applied successfully to several tasks taken from the machine learning literature.
New Generation ComputingInverse entailment and progol
1,408 Citations1995Stephen Muggleton
Mode-Directed Inverse Entailment (MDIE) is introduced as a generalisation and enhancement of previous approaches for inverting deduction and an implementation of MDIE in the Progol system is described.
Lecture notes in computer scienceRule induction with CN2: Some recent improvements
866 Citations1991Peter Clark, Robin Boswell
Improvements to the CN2 algorithm are described, including the use of the Laplacian error estimate as an alternative evaluation function and it is shown how unordered as well as ordered rules can be generated.
Computer CompactsA theory and methodology of inductive learning
778 Citations1983Ryszard S. Michalski
Artificial IntelligenceTheories for mutagenicity: a study in first-order and feature-based induction
300 Citations1996Ashwin Srinivasan, Stephen Muggleton +2 more
This work considers the problem of predicting the mutagenic activity of small molecules: a property that is related to carcinogenicity, and an important consideration in developing less hazardous drugs, and compares the predictive power of the logical theories constructed against benchmarks set by regression, neural, and tree-based methods.
Machine LearningClausal Discovery
238 Citations1997Luc De Raedt, Luc De Raedt
CLAUDIEN is an inductive logic programming engine that fits in the descriptive data mining paradigm and employs a novel declarative bias mechanism to define the set of clauses that may appear in a hypothesis.
Lecture notes in computer scienceMining association rules in multiple relations
188 Citations1997Luc De Raedt, Luc De Raedt
The system Warmr is presented, which extends Apriori to mine association rules in multiple relations, and is applied to the natural language processing task of mining part-of-speech tagging rules in a large corpus of English.
Communications of the ACMApplications of inductive logic programming
166 Citations1995Ivan Bratko, Stephen Muggleton
Attribute-based learning is limited to non-relational descriptions of objects in the sense that the learned descriptions do not specify relations among the objects' parts, and the lack of relations makes the concept description language inappropriate for some domains.
Pruning and Grouping Discovered Association Rules
154 Citations1995Hannu Toivonen, Mika Klemettinen +3 more
This work shows how the set of rules can be pruned by forming rule covers, and discusses grouping of association rules by clustering, and presents some experimental results of both pruning and grouping.
Artificial IntelligenceLogical settings for concept-learning
152 Citations1997Luc De Raedt
It is shown that learning from interpretations reduces toLearning from entailment, which in turn reduces to learning from satisfiability, which reduces to inductive logic programming and computational learning theory.
Lecture notes in computer scienceInductive constraint logic
117 Citations1995Luc De Raedt, Wim Van Laer
A novel approach to learning first order logic formulae from positive and negative examples is presented, which corresponds to a conjuctive normal form where each conjunct forms a constraint on positive examples.
Artificial IntelligenceTop-down induction of first-order logical decision trees
58 Citations1998Hendrik Blockeel, Luc De Raedt
This dissertation discusses the application domain of decision tree learning and extends it towards the first order logic context of Inductive Logic Programming.
Lecture notes in computer scienceLookahead and discretization in ILP
54 Citations1997Hendrik Blockeel, Luc De Raedt
The results show that both techniques improve the quality of the induced theory, while computational costs are acceptable.
Lecture notes in computer scienceOn multi-class problems and discretization in inductive logic programming
36 Citations1997Wim Van Laer, Luc De Raedt +1 more
In practical applications of machine learning and knowledge discovery, handling multi-class problems and real numbers are important issues and attribute-value learners address these problems as a rule, but few ILP systems do so.
Lecture notes in computer scienceDetecting traffic problems with ILP
24 Citations1998Sašo Džeroski, Nico Jacobs +4 more
Three state-of-the art ILP systems are applied to learn how to detect traffic problems and compare their performance to the performance of a propositional learning system on the same problem.
Lirias (KU Leuven)Mining a natural language corpus for multi-relational association rules
3 Citations1997Luc De Raedt, Luc De Raedt