Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Tight Upper Bound on the Number of Candidate Patterns   In the context of mining for frequent patterns using the standard levelwise
algorithm, the following question arises: given the current level and the
current set of frequent patterns, what is the maximal number of candidate
patterns that can be generated on the next level? We answer this question by
providing a tight upper bound, derived from a combinatorial result from the
sixties by Kruskal and Katona. Our result is useful to reduce the number of
database scans.

24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
30
The categories of this paper are: q-alg
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol