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

Mining Maximal Patterns Based on Improved FP-tree and Array Technique

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)
Hua-jin Wang ; Sch. of Inf. Eng., Jiangxi Univ. of Sci. & Technol., Ganzhou, China ; Chun-an Hu

Mining frequent patterns is important for mining association rules. However, because of the inherent complexity, mining complete frequent patterns from a dense database could be impractical, and the quantity of the mined patterns is usually very large, it is hard to understand and make use of them. Maximal frequent patterns contain and compress all frequent patterns, and the memory needed for saving them is much smaller than that needed for saving complete patterns, thus it is greatly valuable to mine maximal frequent patterns. In this paper, the structure of a traditional FP-tree is improved , an efficient algorithm for mining maximal frequent patterns based on improved FP-tree and array technique, called IAFP-max, is presented. By introducing the concept of postfix sub-tree, the presented algorithm needn't generate the candidate of maximal frequent patterns in mining process and therefore greatly reduces the memory consume, and it also uses an array-based technique to reduce the traverse time to the improved FP-tree. The experimental evaluation shows that this algorithm outperforms most exiting algorithms MAFIA, GenMax and FPmax*.

Published in:

Intelligent Information Technology and Security Informatics (IITSI), 2010 Third International Symposium on

Date of Conference:

2-4 April 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.