Efficient Algorithms for Incremental Update of Frequent Sequences

  • Authors:
  • Minghua Zhang;Ben Kao;David Wai-Lok Cheung;Chi Lap Yip

  • Affiliations:
  • -;-;-;-

  • Venue:
  • PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.