• 1 Birkbeck College [University of London]
• 2 Laboratoire d'Informatique de Cergy-Pontoise
• 3 Laboratoire d'Informatique de Cergy-Pontoise [UGB]
• 4 Université Gaston Berger de Saint-Louis Sénégal

Missing values in databases have motivated many researches in the field of KDD, specially concerning prediction. However, to the best of our knowledge, few appraoches based on association rules have been proposed so far. In this paper, we show how to adapt the levelwise algorithm for the mining of association rules in order to mine frequent rules with a confidence equal to 1 from a relational table. In our approach, the consequents of extracted rules are either an interval or a set of values, according to whether the domain of the predicted attribute is continuous or discrete.