Computational Complexity of Three Central Problems in Itemset Mining

no code implementations • 4 Dec 2020 • Christian Bessiere, Mohamed-Bachir Belaid, Nadjib Lazaar

Itemset mining is one of the most studied tasks in knowledge discovery.

Partial Queries for Constraint Acquisition

no code implementations • 14 Mar 2020 • Christian Bessiere, Clement Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh

Learning constraint networks is known to require a number of membership queries exponential in the number of variables.

Users Constraints in Itemset Mining

no code implementations • 31 Dec 2017 • Christian Bessiere, Nadjib Lazaar, Yahia Lebbah, Mehdi Maamar

Discovering significant itemsets is one of the fundamental problems in data mining.

Sketched Answer Set Programming

1 code implementation • 21 May 2017 • Sergey Paramonov, Christian Bessiere, Anton Dries, Luc De Raedt

Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems.

The Inductive Constraint Programming Loop

no code implementations • 12 Oct 2015 • Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis

Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems.

BIG-bench Machine Learning Scheduling

Tractability and Decompositions of Global Cost Functions

no code implementations • 9 Feb 2015 • David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Kam Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex, Yi Wu

A global cost function is called tractable projection-safe when applying an EPT to it is tractable and does not break the tractability property.