By Topic

A fast algorithm for discovering maximum frequent itemsets

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)
Yang Kai ; Sch. of Software, Univ. of Sci. & Technol. LiaoNing, Anshan, China ; Ma Yuan

Max Frequent pattern mining is a essential technology and step in mining associations rules. Max frequent item sets contain the exact information of all the frequent itemsets. This paper proposed a fast algorithm for discovering maximuum frequent itemsets called FA-DMFI which can store attributes association information through scanning database only once. Then the max frequent itemsets is discovered in the association matrix by means of the bottom-up and top-down searching strategy. Therefore the algorithm execute time is reduced remarkably. mExperimental results show its effectiveness and efficiency.

Published in:

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Date of Conference:

27-29 May 2011