Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/7470
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGeetha, M.-
dc.contributor.authorD'Souza, R.J.-
dc.date.accessioned2020-03-30T09:59:11Z-
dc.date.available2020-03-30T09:59:11Z-
dc.date.issued2009-
dc.identifier.citationProceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009, 2009, Vol.2, , pp.62-66en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7470-
dc.description.abstractWe 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.titleA dynamic approach for discovering maximal frequent itemsetsen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
7470.pdf243.54 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.