Mining Negatives Association Rules Using Constraints

In this work we address the problem of mining strong negative rules by extending the SAT-Based approach proposed in [1]. We show that the conviction constraint leads to a non-linear constraints that have to be managed efficiently to prune the search space. Experiments results explore the efficiency of our new approach.