Monotone functions :

Convex hull :

CIMCP, correlated and discriminative itemset mining.

CIMCP is the Correlated/Discriminative Itemset Mining system that uses Constraint Programming. It can prune te search space extremely efficiently for correlation measures such as information gain and chi-square and other disciminative measures such as accuracy and laplace.
The system even allows to mine all itemsets that could be optimal according to a correlation measure, namely all the itemset on the convex hull in PN-space.

CIMCP is fully compatible and builds further on FIM_CP and Gecode, an open and efficient constraint solver written in C++.

The Models

The models are divided in 3 categories, depending on their constraints:

Every model has a link to its source file, ignore the rest of the Doxygen documentation, as it does not capture the structure that most of the models use.

For these models we implemented a custom constraint in gecode. If you want to do something similar, look at the source of constraint_Fconvex.cpp. An example of a stand-alone constraint is FconvexBoolGq, but the file contains more propagators to support reification.