A dynamic approach for discovering maximal frequent itemsets

dc.contributor.author	Geetha, M.
dc.contributor.author	D'Souza, R.J.
dc.date.accessioned	2020-03-30T09:59:11Z
dc.date.available	2020-03-30T09:59:11Z
dc.date.issued	2009
dc.description.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. � 2009 IEEE.	en_US
dc.identifier.citation	Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009, 2009, Vol.2, , pp.62-66	en_US
dc.identifier.uri	https://idr.nitk.ac.in/handle/123456789/7470
dc.title	A dynamic approach for discovering maximal frequent itemsets	en_US
dc.type	Book chapter	en_US

Files

Now showing 1 - 1 of 1