Earticle

초록

영어

Although Eclat algorithm is an efficient algorithm for mining association rules, there are some disadvantages which limit the efficient of Eclat. In this paper, we proposed an improved Eclat algorithm called Eclat_growth which is based on the increased search strategy. There are three main steps in the Eclat_growth algorithm. First, it scans the database and stores it into a table using vertical data format. Then, it builds an increased two-dimensional pattern tree and the TID_sets of itemsets in the vertical data format table are added into the pattern tree row by row. New frequent itemsets are generated by combining the new added item data with the existing frequent itemsets in the pattern tree. Finally, all frequent itemsets can be found by picking up all nodes of the pattern tree. In the process of generating new frequent itemsets, the prior knowledge is used to fully clip the candidate itemsets. In the process of generating an intersection of two itemsets and calculating the support degree, we proposed a new method called BSRI (Boolean array setting and retrieval by indexes of transactions) to reduce the run time. By comparing Eclat_growth with Eclat, Eclat-diffsets, Eclat-opt and hEclat, it is indicated that Eclat_growth has the highest performance in mining associating rules from various databases.

목차

Abstract
 1. Introduction
 2. Eclat and Improved Algorithms
  2.1. Data Format of Eclat
  2.2. Eclat Algorithm
  2.3. Existing Improved Eclat Algorithms
 3. Eclat_Growth Algorithm
  3.1. The Main Process of Eclat_Growth Algorithm
  3.2. The Increased Two-Dimensional Pattern Tree
  3.3. The Calculation of Intersection and Support Degree
 4. Experimental Studies
  4.1. Experimental Results
  4.2. Performance Analysis
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Zhiyong Ma [ Faculty of Mechanical Engineering and Mechanics, Zhejiang Provincial Key Lab of Part Rolling Technology, Ningbo University 818 Fenghua Rd., Ningbo City, Zhejiang Province 315211, P. R. China ]
• Juncheng Yang [ Faculty of Mechanical Engineering and Mechanics, Zhejiang Provincial Key Lab of Part Rolling Technology, Ningbo University 818 Fenghua Rd., Ningbo City, Zhejiang Province 315211, P. R. China ]
• Taixia Zhang [ Faculty of Mechanical Engineering and Mechanics, Zhejiang Provincial Key Lab of Part Rolling Technology, Ningbo University 818 Fenghua Rd., Ningbo City, Zhejiang Province 315211, P. R. China ]
• Fan Liu [ Faculty of Mechanical Engineering and Mechanics, Zhejiang Provincial Key Lab of Part Rolling Technology, Ningbo University 818 Fenghua Rd., Ningbo City, Zhejiang Province 315211, P. R. China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605