#### Filter Results:

#### Publication Year

1994

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Luc Dehaspe, Hannu Toivonen
- Data Min. Knowl. Discov.
- 1999

Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent itemsets, i.e., all combinations of items that are found in a sufficient number of examples. The fundamental task of association rule and frequent set discovery has been extended… (More)

- Luc Dehaspe, Luc De Raedt
- ILP
- 1997

The application of algorithms for eeciently generating association rules is so far restricted to cases where information is put together in a single relation. We describe how this restriction can be overcome through the combination of the available algorithms with standard techniques from the eld of inductive logic programming. We present the system Warmr,… (More)

- Luc Dehaspe
- ILP
- 1997

We present the learning system Maccent which addresses the novel task of stochastic MAximum ENTropy modeling with Clausal Constraints. Maximum Entropy method is a Bayesian method based on the principle that the target stochastic model should be as uniform as possible, subject to known constraints. Maccent incorporates clausal constraints that are based on… (More)

- Luc Dehaspe
- AI Commun.
- 1999

- Luc Dehaspe, Hannu Toivonen, Ross D. King
- KDD
- 1998

The discovery of the relationships between chemical structure and biological function is central to biological science and medicine. In this paper we apply data mining to the problem of predicting chemical carcino-genicity. This toxicology application was launched at IJCAI'97 as a research challenge for artificial intelligence. Our approach to the problem… (More)

- Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, Henk Vandecasteele
- J. Artif. Intell. Res.
- 2002

Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficiency of ILP systems must improve substantially. To this end, the notion of a query pack is introduced: it structures sets of similar queries. Furthermore, a mechanism is described… (More)

- Ross D. King, Andreas Karwath, Amanda Clare, Luc Dehaspe
- Bioinformatics
- 2001

MOTIVATION
Data Mining Prediction (DMP) is a novel approach to predicting protein functional class from sequence. DMP works even in the absence of a homologous protein of known function. We investigate the utility of different ways of representing protein sequence in DMP (residue frequencies, phylogeny, predicted structure) using the Escherichia coli genome… (More)

- Luc De Raedt, Luc Dehaspe
- Machine Learning
- 1997

The clausal discovery engine Claudien is presented. Claudien is an inductive logic programming engine that fits in the descriptive data mining paradigm. Claudien addresses characteristic induction from interpretations, a task which is related to existing formalisations of induction in logic. In characteristic induction from interpretations, the regularities… (More)

- Ross D. King, Ashwin Srinivasan, Luc Dehaspe
- Journal of Computer-Aided Molecular Design
- 2001

Data mining techniques are becoming increasingly important in chemistry as databases become too large to examine manually. Data mining methods from the field of Inductive Logic Programming (ILP) have potential advantages for structural chemical data. In this paper we present Warmr, the first ILP data mining algorithm to be applied to chemoinformatic data.… (More)

- Luc Dehaspe, Luc De Raedt
- ISMIS
- 1996

We describe the principles and functionalities of Dlab (Declarative LAnguage Bias). Dlab can be used in inductive learning systems to deene syntactically and traverse eeciently nite subspaces of rst order clausal logic, be it a set of propositional formulae, association rules, Horn clauses, or full clauses. A Prolog implementation of Dlab is available by… (More)