The document describes the process of finding frequent itemsets in a database using the FP-Growth algorithm with a minimum support of 3. It outlines the steps involved in building an FP-tree from transaction data, including determining item frequencies, prioritizing items, and ordering itemsets. The final output is a constructed FP-tree that represents the item frequencies organized hierarchically.

1. - Ashish pardeshi
- Jay paygude
- Vishwa gawade
PRESENTED BY
- Govind Gore

2.  Example : Find all frequent itemsets in the database using FP-growth
algorithm. Take minimum support = 3
• Now we will build a FP Tree of that database
Transactio
n Id
Items
T1 I1,I3,I4,I5
T2 I2,I4,I5,I6
T3 I1,I2,I3
T4 I2,I3,I4,I5,I6
T5 I2,I4,I6
T6 I2,I3,I4,I6
T7 I1,I2,I4
T8 I1,I2,I4,I5,I6
T9 I1,I2
T10 I4,I5

3. • Find Frequency of occurrence :
• Priority the items :
Since min_sup = 3
Transactio
n Id
Frequency
I1 5
I2 8
I3 4
I4 8
I5 5
I6 5
Transa
ction
Id
Frequ
ency
Priority
I1 5 3
I2 8 7
I3 4 6
I4 8 2
I5 5 4
I6 5 5

4. ● Ordering each itemsets as per the priorities:
Transaction
Id
Items Ordered Items
T1 I1,I3,I4,I5 I4,I1,I5,I3
T2 I2,I4,I5,I6 I2,I4,I5,I6
T3 I1,I2,I3 I2,I1,I3
T4 I2,I3,I4,I5,I6 I2,I4,I5,I6,I3
T5 I2,I4,I6 I2,I4,I6
T6 I2,I3,I4,I6 I2,I4,I6,I3
T7 I1,I2,I4 I2,I4,I1
T8 I1,I2,I4,I5,I6 I2,I4,I1,I5,I6
T9 I1,I2 I2,I1
T10 I4,I5 I4,I5

5. ● Now drawing FP-tree by using ordered itemsets one by one : Row 1
Null
I4: 1
I1: 1
I5: 1
I3: 1

6.  For, Row 2 :
Null
I1: 1
I6: 1
I4: 1
I5: 1
I4: 1
I2: 2
I5: 1
I3: 1

7.  For, Row 3 :
Null
I5: 1
I1: 1
I4: 1 I2: 2
I4: 1
I5: 1
I6: 1
I1: 1
I3: 1
I3: 1

8.  For, Row 4 :
Null
I5: 1
I1: 1
I4: 1 I2: 3
I4: 2
I5: 2
I6: 2
I1: 1
I3: 1
I3: 1 I3: 1

9.  For, Row 5 :
Null
I6: 1
I5: 1
I2: 4
I4: 3
I5: 2
I6: 2
I4: 1
I1: 1
I3: 1
I3: 1
I1: 1
I3: 1

10.  For, Row 6 :
Null
I6: 2
I5: 1
I2: 5
I4: 4
I5: 2
I6: 2
I4: 1
I1: 1
I3: 1 I3: 1
I3: 1
I1: 1
I3: 1

11.  For, Row 7 :
Null
I6: 2
I5: 1
I2: 6
I4: 5
I5: 2
I6: 2
I4: 1
I1: 1
I3: 1 I3: 1
I3: 1
I1: 1
I3: 1
I1: 1

12.  For, Row 8 :
Null
I6: 2
I5: 1
I2: 7
I4: 6
I5: 2
I6: 2
I4: 1
I1: 1
I3: 1 I3: 1
I3: 1
I1: 1
I3: 1
I1: 2
I5: 1
I6: 1

13.  For, Row 9 :
Null
I6: 2
I5: 1
I2: 8
I4: 6
I5: 2
I6: 2
I4: 1
I1: 1
I3: 1
I3: 1
I3: 1
I1: 2
I3: 1
I1: 2
I5: 1
I6: 1

14. For, Row 10: Final
Tree =>> Null
I6: 2
I5: 1
I2: 8
I4: 6
I5: 2
I6: 2
I4: 2
I1: 1
I3: 1
I3: 1
I3: 1
I1: 2
I3: 1
I1: 2
I5: 1
I6: 1
I5: 1