By Topic

An Efficient Algorithm for Frequent Closed Itemsets Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lisheng Ma ; Dept. of Comput. Sci. & Technol., Chuzhou Univ., Chuzhou ; Yi Qi

Efficient algorithms for mining frequent itemsets are crucial for mining association rules. Most existing work focuses on mining all frequent itemsets. However, since any subset of a frequent set also is frequent, it is sufficient to mine the set of frequent closed itemsets which determines exactly the complete set of all frequent itemsets and is usually much smaller than the laster. In this paper, we study the performance of the existing approaches for mining frequent closed itemsets. We also develop an algorithm, called FCFIA. In this algorithm, we develop and integrate two techniques in order to improve the efficiency of mining frequent closed itemsets. We also present experimental results which show that our method outperforms the existing methods FPclose.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:4 )

Date of Conference:

12-14 Dec. 2008