Incremental mining of sequential patterns in large databases

  • Authors:
  • Florent Masseglia;Pascal Poncelet;Maguelonne Teisseire

  • Affiliations:
  • INRIA Sophia Antipolis, 2004 route des lucioles, BP 93 Sophia Antipolis FR-06902, France;Laboratoire LGI2P, Ecole des Mines d'Alès, Site EERIE, Parc Scientifique Georges Besse 30035 Nîmes Cedex 1, France;LIRMM, 161 rue Ada 34392 Montpellier Cedex 5, France

  • Venue:
  • Data & Knowledge Engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment.