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

New Algorithm of Maximum Frequent Itemsets Based on FP-Tree for Mining Multiple-Level Association Rules

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)
Peng Dong ; Coll. of Inf. Eng., Dalian Univ. Dalian, Dalian ; Bo Chen

Discovering maximum frequent item sets is a key problem in data mining. In order to overcome the deficiencies of apriori-like algorithms which adopt candidate itemsets generation-and-test approach, we propose a new algorithm ML_DMFIA which based on DMFIA to mine maximum frequent itemsets in multiple-level association rules. ML_DMFIA utilizes FP-tree structure and up-down progressive deepening searching idea which can avoid making multiple passes over database and does not generate candidate itemsets, consequently, it reduces CPU time and I/O time remarkably. Our performance study shows that ML_DMFIA is more efficient than ML_T2 algorithm for mining both long and short frequent itemsets in mining multiple-level association rules.

Published in:

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

Date of Conference:

12-14 Dec. 2008

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.