数据挖掘-Pattern_Discovery_Lecture_3.5.pdf

Session 5: FPGrowth: A Pattern Growth Approach FPGrowth: Mining Frequent Patterns by Pattern Growth  Idea: Frequent pattern growth (FPGrowth)  Find frequent single items and partition the database based on each such item  Recursively grow frequent patterns by doing the above for each partitioned database (also called conditional database)  To facilitate efficient processing, an efficient data structure, FP-tree, can be constructed  Mining becomes  Recursively construct and mine (conditional) FP-trees  Until the resulting FP-tree is empty, or until it contains only one path— single path will generate all the combinations of its sub-paths, each of which is a frequent pattern 2 Example: Construct FP-tree from a Transational DB TID Items in the Transaction Ordered, frequent items 100 {f, a, c, d, g, i, m, p} {f, c, a, m, p } 200 {a, b, c, f, l, m, o} {f, c, a, b, m } 300 {b, f, h, j, o, w} {f, b } 400 {b, c, k, s, p} {c, b, p} 500 {a, f, c, e, l, p, m, n} {f, c, a, m, p } {} 1. Scan DB once, find single item frequent Header Table pattern: Let min_support = 3 Item Frequency header f:4 c:1 f:4, a:3, c:4, b:3, m:3, p:3 f 4 c:3 b:1 b:1 2. Sort frequent items in frequency c 4 descending order, f-list