Fundamentals of Data Mining

Semester 2, Year 3
Faculty of Computing
Sri Lanka Institute of Information Technology

FP-Growth Example

Find all frequent itemsets in the following database using FP-growth algorithm. Take minimum
support as 30%.

TID Items Ordered Items

1 E, A, D, B B, D, A, E
2 D, A, C, E, B B, D, A, E, C
3 C, A, B. E B, A, E, C
4 B, A, D B, D, A
5 D D
6 D, B B, D
7 A, D, E D, A, E
8 B, C B, C

Minimum support count is ceiling(0.3 * 8) = 3

F-list or header table for the original DB

B:6, D:6, A: 5, E:4, C: 3
Conditional pattern base for C:3
BDAE: 1; B: 1; BAE: 1
F-list: B:3

Conditional FP-tree for C

B: 3

Frequent patterns
C:3, BC:3

Conditional pattern base for E:4

BDA: 2; BA:1; DA:1
F-list: A:4, B:3, D:3

Conditional FP-tree for E

NULL
|
A:4 – D:1
|
B:3
|
D:2

Recursion
Conditional pattern base for DE:3
A:1, AB:2
Conditional FP-tree for DE
A:3
Frequent patterns
DE:3, ADE:3

Conditional pattern base for BE:3

A:3
Conditional FP-tree for BE
A:3
Frequent patterns
BE:3, ABE:3

Conditional pattern base for AE:4

NULL
Conditional FP-tree for DE
NULL
Frequent patterns
AE:4
and
E:4
Conditional pattern base for A:5
BD: 3; B:1; D:1
F-list: B:4, D:4
Conditional FP-tree for A

NULL – D:1
|
B:4
|
D:3

Recursion
Conditional pattern base for AD:4
B:3
Conditional FP-tree for AD
B:3

Frequent patterns
AD:4, ABD:3
Conditional pattern base for AB:4
NULL

Frequent patterns
AB:4
and
A:5

Conditional pattern base for D:6

B: 4
Conditional FP-tree for D
B: 4
Frequent patterns
D:6, BD:4

Conditional pattern base for B:6

NULL
Conditional FP-tree for B
NULL
Frequent patterns
B:6