An Efficient Tree Structure Method for Mining Association Rules

트리 구조를 이용한 연관규칙의 효율적 탐색

  • Kim, Chang-Oh (Department of Industrial Engineering, Hanyang University) ;
  • Ahn, Kwang-Il (Department of Industrial Engineering, Hanyang University) ;
  • Kim, Seong-Jip (Department of Industrial Engineering, Hanyang University) ;
  • Kim, Jae-Yearn (Department of Industrial Engineering, Hanyang University)
  • 김창오 (한양대학교 산업공학과) ;
  • 안광일 (한양대학교 산업공학과) ;
  • 김성집 (한양대학교 산업공학과) ;
  • 김재련 (한양대학교 산업공학과)
  • Received : 19991200
  • Accepted : 20001100
  • Published : 2001.03.31

Abstract

We present a new algorithm for mining association rules in the large database. Association rules are the relationships of items in the same transaction. These rules provide useful information for marketing. Since Apriori algorithm was introduced in 1994, many researchers have worked to improve Apriori algorithm. However, the drawback of Apriori-based algorithm is that it scans the transaction database repeatedly. The algorithm which we propose scans the database twice. The first scanning of the database collects frequent length l-itemsets. And then, the algorithm scans the database one more time to construct the data structure Common-Item Tree which stores the information about frequent itemsets. To find all frequent itemsets, the algorithm scans Common-Item Tree instead of the database. As scanning Common-Item Tree takes less time than scanning the database, the algorithm proposed is more efficient than Apriori-based algorithm.

Keywords