IMIDB: An Algorithm for Indexed Mining of Incremental Databases

Abstract Association rules provide important knowledge that can be extracted from transactional databases. Owing to the massive exchange of information nowadays, databases become dynamic and change rapidly and periodically: new transactions are added to the database and/or old transactions are updated or removed from the database. Incremental mining was introduced to overcome the problem of maintaining previously generated association rules in dynamic databases. In this paper, we propose an efficient algorithm (IMIDB) for incremental itemset mining in large databases. The algorithm utilizes the trie data structure for indexing dynamic database transactions. Performance comparison of the proposed algorithm to recently cited algorithms shows that a significant improvement of about two orders of magnitude is achieved by our algorithm. Also, the proposed algorithm exhibits linear scalability with respect to database size.

[1]  Chia-Hui Chang,et al.  Enhancing SWF for Incremental Association Mining by Itemset Maintenance , 2003, PAKDD.

[2]  Howard J. Hamilton,et al.  Mining itemset utilities from transaction databases , 2006, Data Knowl. Eng..

[3]  David Wai-Lok Cheung,et al.  A General Incremental Technique for Maintaining Discovered Association Rules , 1997, DASFAA.

[4]  D. Cheung,et al.  Maintenance of Discovered Association Rules , 2002 .

[5]  Chin-Chen Chang,et al.  An efficient algorithm for incremental mining of association rules , 2005, 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications (RIDE-SDMA'05).

[6]  Ajith Abraham,et al.  An efficient algorithm for incremental mining of temporal association rules , 2010, Data Knowl. Eng..

[7]  Qiang Yang,et al.  Mining high utility itemsets , 2003, Third IEEE International Conference on Data Mining.

[8]  Hamed Nassar,et al.  An efficient technique for incremental updating of association rules , 2008, Int. J. Hybrid Intell. Syst..

[9]  Tzung-Pei Hong,et al.  A Fast Updated Frequent Pattern Tree , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[10]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[11]  Ferenc Bodon,et al.  A trie-based APRIORI implementation for mining frequent item sequences , 2005 .

[12]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[13]  P. Thangaraj,et al.  IMine: Index Support for Item Set Mining in Item Set Extraction , 2011 .

[14]  Tzung-Pei Hong,et al.  An incremental mining algorithm for high utility itemsets , 2012, Expert Syst. Appl..

[15]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[16]  Tzung-Pei Hong,et al.  Incrementally fast updated frequent pattern trees , 2008, Expert Syst. Appl..

[17]  Ming-Syan Chen,et al.  Sliding-window filtering: an efficient algorithm for incremental mining , 2001, CIKM '01.

[18]  Tzung-Pei Hong,et al.  The Pre-FUFP algorithm for incremental mining , 2009, Expert Syst. Appl..

[19]  Stephen S.-T. Yau,et al.  TCOM, an innovative data structure for mining association rules among infrequent items , 2009, Comput. Math. Appl..