Title :
A Dynamic Approach for Discovering Maximal Frequent Itemsets
Author :
Geetha, M. ; D´Souza, R.J.
Author_Institution :
Dept. of Comput. Sci. & Eng., Manipal Inst. of Technol., Manipal
Abstract :
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.
Keywords :
data mining; tree data structures; dynamic itemset tree; dynamic itemsets counting technique; maximal frequent itemset discovery; sparse database; Computer science; Counting circuits; Data engineering; Data structures; Heuristic algorithms; Itemsets; Paper technology; Solids; Transaction databases; Tree data structures; Tree; confidence; dynamic; frequent; prunning;
Conference_Titel :
Computer Engineering and Technology, 2009. ICCET '09. International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-3334-6
DOI :
10.1109/ICCET.2009.153
