126 citations · 298 across the 14 of their papers we have counts for
17 papers
Computational Complexity of Three Central Problems in Itemset Mining
Christian Bessiere, Mohamed-Bachir Belaid, Nadjib Lazaar
Itemset mining is one of the most studied tasks in knowledge discovery. In this paper we analyze the computational complexity of three central itemset mining problems. We prove tha…
Partial Queries for Constraint Acquisition
Christian Bessiere, Clement Carbonnel, Anton Dries +8
Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the us…
Users Constraints in Itemset Mining
Christian Bessiere, Nadjib Lazaar, Yahia Lebbah +1
Discovering significant itemsets is one of the fundamental problems in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining t…
Sketched Answer Set Programming
Sergey Paramonov, Christian Bessiere, Anton Dries +1
Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models is not trivial. We propose a novel method, called Sketched Ans…
The Inductive Constraint Programming Loop
Christian Bessiere, Luc De Raedt, Tias Guns +7
Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems. At the same time, one continuously…
Tractability and Decompositions of Global Cost Functions
David Allouche, Christian Bessiere, Patrice Boizumault +8
Enforcing local consistencies in cost function networks is performed by applying so-called Equivalent Preserving Transformations (EPTs) to the cost functions. As EPTs transform the…