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

Mining association rules based on an improved Apriori Algorithm

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

4 Author(s)
Yanfei Zhou ; Sch. of Commun. & Inf. Eng., Shanghai Univ., Shanghai, China ; Wanggen Wan ; Junwei Liu ; Long Cai

In this paper, we first describe the classical Apriori Algorithm. And then, we present the defects exist in this algorithm. Such as spending a lot of time to produce the candidate item-sets, scanning the database in a simple method, and so on. At last we promote our improved Apriori Algorithm which consists of three parts. The first part is reducing the number of judgments, and the second part is reducing the number of candidate frequent item-sets. The last part is optimizing the database. And the experimental results proved our improvement.

Published in:

Audio Language and Image Processing (ICALIP), 2010 International Conference on

Date of Conference:

23-25 Nov. 2010

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.