Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Constraint-based sequence mining using constraint programming   The goal of constraint-based sequence mining is to find sequences of symbols
that are included in a large number of input sequences and that satisfy some
constraints specified by the user. Many constraints have been proposed in the
literature, but a general framework is still missing. We investigate the use of
constraint programming as general framework for this task. We first identify
four categories of constraints that are applicable to sequence mining. We then
propose two constraint programming formulations. The first formulation
introduces a new global constraint called exists-embedding. This formulation is
the most efficient but does not support one type of constraint. To support such
constraints, we develop a second formulation that is more general but incurs
more overhead. Both formulations can use the projected database technique used
in specialised algorithms. Experiments demonstrate the flexibility towards
constraint-based settings and compare the approach to existing methods.

32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
36
The categories of this paper are: cmp-lg