Earticle

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Concepts and Related Works
  2.1. Transaction Database
  2.2. Support
  2.3. Frequent Itemset and Frequent Closed Itemset
  2.4. Minimal Generators [22, 25-26]
  2.5. Mining FCI
  2.6. Mining MNAR/NAR
  2.7. Building Frequent (closed) Itemsets Lattice
  2.8. Generating Association Rules from Frequent Itemsets Lattice
 3. Generating Minimal Non-redundant Association Rules from FCIL
  3.1. Algorithm for Generating MNAR from FCIL
  3.2. Illustration
 4. Experimental Results
 5. Conclusion and Future Work
 References

키워드

저자

• Bay Vo [ Faculty of Information Technology, Ho Chi Minh City University of Technology ]
• Bac Le [ Faculty of Information Technology University of Science ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605