Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A global constraint for closed itemset mining   Discovering the set of closed frequent patterns is one of the fundamental
problems in Data Mining. Recent Constraint Programming (CP) approaches for
declarative itemset mining have proven their usefulness and flexibility. But
the wide use of reified constraints in current CP approaches raises many
difficulties to cope with high dimensional datasets. This paper proposes CLOSED
PATTERN global constraint which does not require any reified constraints nor
any extra variables to encode efficiently the Closed Frequent Pattern Mining
(CFPM) constraint. CLOSED-PATTERN captures the particular semantics of the CFPM
problem in order to ensure a polynomial pruning algorithm ensuring domain
consistency. The computational properties of our constraint are analyzed and
their practical effectiveness is experimentally evaluated.

11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg