Sciweavers

Share
ACMSE
2008
ACM

Mining frequent sequential patterns with first-occurrence forests

11 years 3 months ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers to the first-occurrences of a symbol in the aggregate tree [1], as the basic data structure for database representation, and does not rebuild aggregate trees for projection databases. The experimental evaluation shows that our new FOF mining algorithm outperforms the PLWAP-tree mining algorithm [2] and the FLWAP-tree mining algorithm [3], both in the mining time and the amount of memory used. Categories and Subject Descriptors H.2.8 [Database Management]: Database Applications-Data mining General Terms Algorithms, Performance, Design Keywords Projection Database, Frequent Patterns
Erich Allen Peterson, Peiyi Tang
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where ACMSE
Authors Erich Allen Peterson, Peiyi Tang
Comments (0)
books