By Topic

A Dynamic Approach for Discovering Maximal 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)
Geetha, M. ; Dept. of Comput. Sci. & Eng., Manipal Inst. of Technol., Manipal ; D'Souza, R.J.

We present a novel method, which reads the database at regular intervals as in dynamic itemsets counting technique and creates a tree called dynamic itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items.

Published in:

Computer Engineering and Technology, 2009. ICCET '09. International Conference on  (Volume:2 )

Date of Conference:

22-24 Jan. 2009