Date Added: Jun 2011
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, the authors use CHARM-L for building FCIL. After that, based on FCIL, an algorithm for fast generating MNAR will be proposed.