Scribd
Upload
46 views13 pages

ESE Handouts 4 - FP Growth Algorithm (Fall 2016)

The FP-Growth algorithm compresses transactional data into a frequent pattern tree (FP-tree) to efficiently mine frequent itemsets. It first scans the database to identify frequent items, then constructs the FP-tree by inserting transactions in order of frequent items. Conditional FP-trees are generated from the FP-tree to recursively mine conditional itemsets without additional database scans.

Uploaded by

unknownartist11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
46 views13 pages

ESE Handouts 4 - FP Growth Algorithm (Fall 2016)

The FP-Growth algorithm compresses transactional data into a frequent pattern tree (FP-tree) to efficiently mine frequent itemsets. It first scans the database to identify frequent items, then constructs the FP-tree by inserting transactions in order of frequent items. Conditional FP-trees are generated from the FP-tree to recursively mine conditional itemsets without additional database scans.

Uploaded by

unknownartist11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 13

ASSOCIATION RULE MINING

FP Growth Algorithm

• One problematic aspect of the Apriori is the candidate


generation
– Source of exponential growth

• Idea: Compress the database into a frequent pattern


tree representing frequent items

1
ASSOCIATION RULE MINING

FP Growth Algorithm

Divide-and-conquer strategy as follows:


• Compress a large database into a compact, Frequent-
Pattern tree (FP-tree) structure
– highly condensed, but complete for frequent pattern
mining
– avoid costly database scans
• Then, divide such a compressed database into a set of
conditional databases(a special kind of projected database)
• And, mine each such database separately

2
ASSOCIATION RULE MINING

FP Growth Algorithm: Tree Construction

• Initially, scan database for frequent 1-itemsets


– Place resulting set in a list L in descending order by
frequency (support)

• Construct an FP-tree
– Create a root node labeled null
– Scan database
• Process the items in each transaction in L order
• From the root, add nodes in the order in which items
appear in the transactions
• Link nodes representing items along different
branches
3
ASSOCIATION RULE MINING

FP Growth Algorithm: Tree Construction

TID Items
1 I1,I2,I5 • Minimum support of ~20% (count of 2)
2 I2,I4 • Frequent 1-itemsets
3 I2,I3,I6 I1, I2, I3, I4, I5
4 I1,I2,I4 • Construct list
5 I1,I3
L = {(I2,7),(I1,6),(I3,6),(I4,2),(I5,2)}
6 I2,I3
7 I1,I3
8 I1,I2,I3,I5
9 I1,I2,I3

4
ASSOCIATION RULE MINING

FP Growth Algorithm: Tree Construction

I2 1 null Create root node


I1 1
I3 0 (I2,1) Scan database
I4 0 Transaction1, I1, I2, I5
I5 1 (I1,1) Order: I2, I1, I5
(I5,1)
Process transaction
Add nodes in item order
Label with items, count

Maintain header table


5
ASSOCIATION RULE MINING

FP Growth Algorithm: Tree Construction

TID Items
I2 2 null
1 I1,I2,I5
I1 1
2 I2,I4
I3 0 (I2,2)
3 I2,I3,I6
I4 1
(I4,1) 4 I1,I2,I4
I5 1 (I1,1)
5 I1,I3
(I5,1) 6 I2,I3
7 I1,I3
8 I1,I2,I3,I5
9 I1,I2,I3

6
ASSOCIATION RULE MINING

TID Items bought (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} min_support =
0.5
300 {b, f, h, j, o} {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}
{}
Steps: Header Table
1. Scan DB once, find
Item frequency head f:4 c:1
frequent 1-itemset (single
item pattern) f 4
c 4 c:3 b:1 b:1
2. Order frequent items in a 3
frequency descending b 3 a:3 p:1
order m 3
3. Scan DB again, construct p 3 m:2 b:1
FP-tree
p:2 m:1
7
ASSOCIATION RULE MINING

FP Growth Algorithm: FP Tree Mining

1) Construct conditional pattern base for each node in the


FP-tree
2) Construct conditional FP-tree from each conditional
pattern-base
3) Recursively mine conditional FP-trees and grow
frequent patterns obtained so far
 If the conditional FP-tree contains a single path,
simply enumerate all the patterns

8
ASSOCIATION RULE MINING

• Starting at the frequent header table in the FP-tree


• Traverse the FP-tree by following the link of each frequent item
• Accumulate all of transformed prefix paths of that item to form a
conditional pattern base

Header Table {}
Conditional pattern bases
Item frequency head f:4 c:1 item cond. pattern base
f 4
c 4 c f:3
c:3 b:1 b:1
a 3 a fc:3
b 3 a:3 p:1
m 3 b fca:1, f:1, c:1
p 3 m:2 b:1 m fca:2, fcab:1
p fcam:2, cb:1
p:2 m:1

9
ASSOCIATION RULE MINING

• For each pattern-base


– Accumulate the count for each item in the base
– Construct the FP-tree for the frequent items of the pattern
base
m-conditional pattern
Header Table {} base:
Item frequency head fca:2, fcab:1
f 4 f:4 c:1 All frequent
{} patterns
c 4 concerning m
c:3 b:1 b:1
a 3   m,
b 3 a:3 p:1 f:3 fm, cm, am,
m 3 fcm, fam, cam,
p 3 m:2 b:1 c:3
fcam
p:2 m:1 a:3
m-conditional FP-tree

10
ASSOCIATION RULE MINING

FP Growth Algorithm: FP Tree Mining


• Suppose an FP-tree T has a single path P
• The complete set of frequent pattern of T can be generated by
enumeration of all the combinations of the sub-paths of P

{} All frequent patterns


concerning m
f:3 m,
c:3 fm, cm, am,
fcm, fam, cam,
a:3 fcam

m-conditional FP-tree

11
ASSOCIATION RULE MINING

FP Growth Algorithm: FP Tree Mining Prefix Paths


(I2 I1,1)
(I2 I1 I3, 1)
Conditional Path
I2 7 null
(I2 I1, 2)
I1 6 Conditional FP-tree
(I1,2)
I3 6 (I2,7) null
I4 2
(I4,1) (I3,2)
I5 2 (I1,4)
(I3,2) (I2,2)
(I5,1) (I4,1)
(I3,2) (I1,2)

(I5,1) (I2 I1 I5, 2),


(I2 I5, 2),
(I1 I5, 2)

12
ASSOCIATION RULE MINING

Reference

Chapter 6 of Hans & Kamber book

13

You might also like