Incremental Mining of Association Rules : A Survey

The association rule mining has been very useful in many applications such as, market analysis, web data analysis, decision making, knowing customer trends etc. In transactional databases as time advances, new transactions are being added and obsolete transactions are discarded. Incremental mining deals with generating association rules based on available knowledge (obtained from mining of previously stored databases) and incremented databases only, without scanning the previously mined databases again. Several research works have been carried out for deriving the association rules and maintaining them efficiently without re-scanning the complete database. In this paper, a survey on different algorithms designed for incremental mining is presented. The algorithms are discussed into two sub-categories namely, apriori based algorithms and tree based algorithms. The pros and cons of these algorithms are also discussed in brief.

[1]  Philip S. Yu,et al.  Data Mining: An Overview from a Database Perspective , 1996, IEEE Trans. Knowl. Data Eng..

[2]  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.

[3]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[4]  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..

[5]  Philip S. Yu,et al.  Efficient Data Mining for Path Traversal Patterns , 1998, IEEE Trans. Knowl. Data Eng..

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

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

[8]  Sanjay Ranka,et al.  An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases , 1997, KDD.

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

[10]  Christie I. Ezeife,et al.  Mining Incremental Association Rules with Generalized FP-Tree , 2002, Canadian Conference on AI.

[11]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[12]  Necip Fazil Ayan,et al.  An efficient algorithm to update large itemsets with early pruning , 1999, KDD '99.

[13]  Adriano Veloso,et al.  Knowledge Management in Association Rule Mining , 2001 .

[14]  Carson Kai-Sang Leung,et al.  CanTree: a tree structure for efficient incremental mining of frequent patterns , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

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

[16]  Xiaodong Chen,et al.  Discovering Temporal Association Rules: Algorithms, Language and System , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[17]  Christie I. Ezeife,et al.  A Low-Scan Incremental Association Rule Maintenance Method Based on the Apriori Property , 2001, Canadian Conference on AI.

[18]  Gustavo Rossi,et al.  An approach to discovering temporal association rules , 2000, SAC '00.