Incremental Mining of Web Sequential Patterns Using PLWAP Tree on Tolerance MinSupport

  • Authors:

  • C. I. Ezeife;Min Chen

  • Affiliations:

  • University of Windsor;University of Windsor

  • Venue:
  • IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an algorithm, PL4UP, which uses the PLWAP tree structure to incrementally update web sequential patterns. PL4UP initially builds a bigger PLWAP tree that includes all sequences in the database with a tolerance support, t, that is a fraction of the database minimum support, s. The position code features of the PLWAP tree are used to efficiently mine this tree to extract both current frequent and non-frequent sequences, which are likely to become frequent when the database is updated. This approachmore quickly updates old frequent patterns without the need to re-scan the entire updated database.