1. Apriori Algorithms Feapres Project

2. Outline • Association Rules Overview • Apriori Overview • Apriori Advantage and Disadvantage • Apriori Algorithms • Step1 – Generate Frequent Items Set • Step 2 – Generate Rules • Improvement • 4.1. Segmental Values (mờhóadữliệu) • 4.2. Get Support (Speed up algorithms) • 4.3. Weight Rules (Find important rules)

3. 1. Association Rules Overview • Association Rule :  relations between variables in large databases. Eg (Bread, Butter) => (Milk) • Algorithms for finding association rules • Apriorialgorithm : • Eclat algorithm • FP-growth algorithm • One-attribute-rule • Zero-attribute-rule

4. 2. Apriori Overview • Best-known algorithm to mine association rules • Advantages • Find all rules • Simple • Disadvantages • Suffers from a number of inefficiencies or trade-offs • Operate in binary data only

5. 3. Apriori Algorithms • Find all frequent itemsets: • Get frequent items: • Items whose occurrence in database is greater than or equal to the min support. • Get frequent itemsets: • Generate candidates from frequent items. • Use the candidate to find the frequent itemsets. • Repeat until there are no new candidates. • Generate strong association rules from frequent itemsets • Rules which satisfy the min support and min confidence.

6. 3. Apriori Algorithms

7. 3. Apriori Algorithms

8. 3.1 Apriori Algorithms : Step1 Min Support = 50 % Min Confidence = 80% Check Support L1 Joint Check Support L2

9. 3.1 Apriori Algorithms : Step1 All subset of frequent Items must be frequent L2 Joint L3 Check Support {ABCDEF} must combine with itemsets like {ABCDEG}

10. 3.1 Apriori Algorithms : Step1

11. 3.2 Apriori Algorithms : Step2

12. 4. IMPROVEMENT 4.1. Segmental Values (mờhóadữliệu) 4.2. Get Support (Speed up algorithms) 4.3. Weight Rules (Find important rules)

13. 4.1. Segmental Values • Major disadvantage of Apriori Algorithms is that it must work on binary database. -> Must convert conventional database to binary database • Value Types • Category values • Continuous values (eg. Age, money, ….)

14. 4.1. Segmental Values • Fuzzy Set • Triangle Function 1 0 a c b

15. 4.1. Segmental Values • Fuzzy Set • Trapezoid Function 1 0 c d a b

16. 4.1. Segmental Values • Age values (0->100) • Young = F1(x,0,0,20,25) (red line) • Middle = F2(x,20,30,40,45) (blue line) • Old = F3(x,40,45,100,100) (yellow line) • MinWT = 0.4 1 0 20 25 30 40 45 100 Example : if F1(43) = 0; F2(43) = 0.5; F3(43) = 0.6) => 43 year old person is consider as both Middle and Old

17. 4.2. Get Support • This procedure is the most time consuming part in the algorithms. Check Support L1 Joint Check Support L2

18. 4.2. Get Support => Need algorithms to calculate intersection of two set (HASH SET)

19. 4.3. Weight Rules • Rules are in form: A => B • Eg: (Buying time = Morning & Buying Method = Online => Bill Amount = High) • Some component are more interested than others (such as Bill Amount) => Each component is weighted • Importance of rule A=>B is

20. THANKS FOR YOUR ATTENTION