A dynamic approach for discovering maximal frequent itemsets

M. Geetha, R. J. D'Souza

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009
Pages62-66
Number of pages5
Volume2
DOIs
Publication statusPublished - 01-06-2009
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Cite this

Geetha, M., & D'Souza, R. J. (2009). A dynamic approach for discovering maximal frequent itemsets. In Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009 (Vol. 2, pp. 62-66). [4769559] https://doi.org/10.1109/ICCET.2009.153