Example of The FP tree algorithm. Explained each and every steps
1. - Sanket Pandharkar - pandharkarsanket19@gmail.com
- ROHIT rote - rohitrote8806@gmail.com
- NIRANT NAIK - nirantnaik4410@gmail.com
- ONKAR CHAVAN - onkarchavan830@gmail.com
PRESENTED BY
Modern College Of Arts, Science & Commerce Ganeshkhind Pune-16.
Department of Computer Science
Data Mining Assignment
Guided By :
Dr. Dipali Meher
2. • Example : Find all frequent itemsets in the database using FP-growth
algorithm. Take minimum support = 2
Transaction Id Items
T1 Milk, Sugar, Bread, Egg
T2 Sugar, Bread, Butter
T3 Milk, Egg, Sugar
T4 Bread, Butter, Egg
T5 Bread, Butter, Milk
T6 Bread, Butter
T7 Milk, Sugar, Egg
T8 Bread, Egg
• Now we will build a FP Tree of that database
• Item Sets are considered in order of their descending value of support count
3. • Find Frequency of occurrence :
Transaction Id Frequency
Milk 4
Sugar 4
Bread 6
Egg 5
Butter 4
• Priority the items :
Transaction Id Frequency Priority
Milk 4 3
Sugar 4 4
Bread 6 1
Egg 5 2
Butter 4 5
Since min_sup = 2