DMA: Matrix Based Dynamic Itemset Mining Algorithm

Updates on an operational database bring forth the challenge of keeping the frequent itemsets up-to-date without re-running the itemset mining algorithms. Studies on dynamic itemset mining, which is the solution to such an update problem, have to address some challenges as handling i updates without re-running the base algorithm, ii changes in the support threshold, iii new items and iv additions/deletions in updates. The study in this paper is the extension of the Incremental Matrix Apriori Algorithm which proposes solutions to the first three challenges besides inheriting the advantages of the base algorithm which works without candidate generation. In the authors' current work, the authors have improved a former algorithm as to handle updates that are composed of additions and deletions. The authors have also carried out a detailed performance evaluation study on a real and two benchmark datasets.

[1]  Sidney Viana,et al.  Matrix Apriori: Speeding Up the Search for Frequent Patterns , 2006, Databases and Applications.

[2]  Osmar R. Zaïane,et al.  Incremental mining of frequent patterns without candidate generation or support constraint , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

[3]  R. Amornchewin,et al.  Incremental association rule mining using promising frequent itemset algorithm , 2007, 2007 6th International Conference on Information, Communications & Signal Processing.

[4]  Gillian Dobbie,et al.  Biologically-Inspired Techniques for Knowledge Discovery and Data Mining , 2014 .

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

[6]  Srinivasan Parthasarathy,et al.  Parallel Algorithms for Discovery of Association Rules , 1997, Data Mining and Knowledge Discovery.

[7]  Iraklis Varlamis,et al.  Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies , 2010, Int. J. Data Warehous. Min..

[8]  Jian Pei,et al.  Preference-Based Frequent Pattern Mining , 2005, Int. J. Data Warehous. Min..

[9]  Baris Yildiz,et al.  COMPARISON OF TWO ASSOCIATION RULE MINING ALGORITHMS WITHOUT CANDIDATE GENERATION , 2010 .

[10]  Hamed Nassar,et al.  DARM: Decremental Association Rules Mining , 2011, J. Intell. Learn. Syst. Appl..

[11]  Jiawei Han,et al.  Maintenance of discovered association rules in large databases: an incremental updating technique , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[12]  S. Jyothi,et al.  Tree-based incremental association rule mining without candidate itemset generation , 2010, Trendz in Information Sciences & Computing(TISC2010).

[13]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[14]  Heikki Mannila,et al.  Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.

[15]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[16]  Yonatan Aumann,et al.  Borders: An Efficient Algorithm for Association Generation in Dynamic Databases , 1999, Journal of Intelligent Information Systems.

[17]  Damla Oguz,et al.  Incremental Itemset Mining Based on Matrix Apriori Algorithm , 2012, DaWaK.

[18]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[19]  Srinivasan Parthasarathy,et al.  New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[20]  Hannu Toivonen,et al.  Sampling Large Databases for Association Rules , 1996, VLDB.

[21]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[22]  Tongyan Li,et al.  IULFP: An efficient incremental updating algorithm based on LFP-tree for mining association rules , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

[23]  Tzung-Pei Hong,et al.  Incremental Mining with Prelarge Trees , 2008, IEA/AIE.

[24]  David Taniar,et al.  Research and Trends in Data Mining Technologies and Applications , 2007 .

[25]  Sebastián Ventura,et al.  Ant Programming Algorithms for Classification , 2014 .

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

[27]  Jiawei Han,et al.  Frequent pattern mining: current status and future directions , 2007, Data Mining and Knowledge Discovery.

[28]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[29]  Wee Keong Ng,et al.  Fast online dynamic association rule mining , 2001, Proceedings of the Second International Conference on Web Information Systems Engineering.

[30]  David Taniar,et al.  Mining Association Rules in Data Warehouses , 2005, Int. J. Data Warehous. Min..

[31]  Alex A. Freitas,et al.  A Tutorial on Hierarchical Classification with Applications in Bioinformatics. , 2007 .