Polytech'Lille, LIFL – CNRS / INRIA – Bâtiment M3, University of Lille 1, 59655 Villeneuve d'Ascq Cedex, France; Clarisse.Dhaenens@lifl.fr; El-Ghazali.Talbi@lifl.fr
An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find non frequent but interesting rules. As the search space may be very large, a discussion about different approaches is proposed and a hybrid approach that combines a metaheuristic and an exact operator is presented.
(Received October 30 2006)
(Accepted October 30 2007)
(Online publication February 21 2008)
Mathematics Subject Classification: