Handling dynamic aspect of databases and multiple support threshold requirements of items are two important challenges of frequent itemset mining algorithms. Existing dynamic itemset mining algorithms are devised for single support threshold whereas multiple support threshold algorithms assume that the databases are static. This paper focuses on dynamic update problem of frequent itemsets under MIS (Multiple Item Support) thresholds and introduces Dynamic MIS algorithm. It is i) tree based and scans the database once, ii) considers multiple support thresholds, and iii) handles increments of additions, additions with new items and deletions. Proposed algorithm is compared to CFP-Growth++ and findings are; in dynamic database 1) Dynamic MIS performs better than CFP-Growth++ since it runs only on increments and 2) Dynamic MIS can achieve speed-up up to 56 times against CFP-Growth++.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com