Cart (Loading....) | Create Account
Close category search window
 

Study on Association Rules Mining Based on Searching Frequent Free Item Sets Using Partition

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

3 Author(s)
Zhang Hui ; Electron. & Inf. Eng. Dept., Tianjin Inst. of Urban Constr., Tianjin, China ; Lu Yu ; Zhou Jinshu

Mining of association rules is an important problem in data mining, given a large set of data, extracting frequent item sets in this set is a challenging job in data mining. Item sets matching is the chief problem in extracting frequent item sets. And item set matching is the bottleneck of the mining process. It also has been proved that extracting frequent free item sets is a useful method. Many efficient algorithms have been proposed in the literature. The idea presented in this paper is to divide the database into multiple partitions and then find frequent free item sets in each partition, then merge the several partitions to generate other frequent free item sets and count the support. The algorithm costs little memory to save additional support numbers of item sets in each partition but greatly reduces the time of item set matching which is the bottleneck of the mining process. The experiments on real datasets have showed its good performance.

Published in:

Information Processing, 2009. APCIP 2009. Asia-Pacific Conference on  (Volume:1 )

Date of Conference:

18-19 July 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.