Efficient Algorithms for Incremental Update of Frequent Sequences

Most of the works proposed so far on mining frequent sequences assume that the underlying database is static. However, in real life, the database is modified from time to time. This paper studies the problem of incremental update of frequent sequences when the database changes. We propose two efficient incremental algorithms GSP+ and MFS+. Throught experiments, we compare the performance of GSP+ and MFS+ with GSP and MFS -- two efficient algorithms for mining frequent sequences. We show that GSP+ and MFS+ effectively reduce the CPU costs of their counterparts with only a small or even negative additional expense on I/O cost.

[1]  Mohammed J. Zaki.  Efficient enumeration of frequent sequences , 1998, CIKM '98.

[2]  D. Cheung,et al.  Maintenance of Discovered Association Rules: When to update? , 1997, DMKD.

[3]  Srinivasan Parthasarathy,et al.  Incremental and interactive sequence mining , 1999, CIKM '99.

[4]  Edward Omiecinski,et al.  Efficient Mining of Association Rules in Large Dynamic Databases , 1998, BNCOD.

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

[6]  Nandlal L. Sarda,et al.  An adaptive algorithm for incremental mining of association rules , 1998, Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130).

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

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

[9]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

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

[11]  Chi Lap Yip,et al.  A GSP-based Efficient Algorithm for Mining Frequent Sequences , 2001 .

[12]  David Wai-Lok Cheung,et al.  FFS - An I/O-Efficient Algorithm for Mining Frequent Sequences , 2001, PAKDD.

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

[14]  David Wai-Lok Cheung,et al.  Maintenance of Discovered Knowledge: A Case in Multi-Level Association Rules , 1996, KDD.

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

[16]  Umeshwar Dayal,et al.  PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.