Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Frequent Closed Itemsets Lattice-based Approach for Mining Minimal
  Non-Redundant Association Rules   There are many algorithms developed for improvement the time of mining
frequent itemsets (FI) or frequent closed itemsets (FCI). However, the
algorithms which deal with the time of generating association rules were not
put in deep research. In reality, in case of a database containing many FI/FCI
(from ten thousands up to millions), the time of generating association rules
is much larger than that of mining FI/FCI. Therefore, this paper presents an
application of frequent closed itemsets lattice (FCIL) for mining minimal
non-redundant association rules (MNAR) to reduce a lot of time for generating
rules. Firstly, we use CHARM-L for building FCIL. After that, based on FCIL, an
algorithm for fast generating MNAR will be proposed. Experimental results show
that the proposed algorithm is much faster than frequent itemsets lattice-based
algorithm in the mining time.

32
The categories of this paper are: atom-ph
17
The categories of this paper are: q-fin
9
The categories of this paper are: nlin
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph
16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
35
The categories of this paper are: mtrl-th
20
The categories of this paper are: acc-phys
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
5
The categories of this paper are: gr-qc