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

Download Now
Provided by: University of Westminster
Topic: Big Data
Format: PDF
In this paper, the authors propose 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 approach more quickly updates old frequent patterns without the need to re-scan the entire updated database.
Download Now

Find By Topic