Question: Consider the following transactional dataset. Using Apriori Algorithm: i) find all the frequent itemsets [5 Marks] ii) then, find all the association rules from the
![the frequent itemsets [5 Marks] ii) then, find all the association rules](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f2e99c7fc7c_54866f2e99c22375.jpg)
Consider the following transactional dataset. Using Apriori Algorithm: i) find all the frequent itemsets [5 Marks] ii) then, find all the association rules from the largest frequent itemset [5 Marks] Note that you have to show the step-by-step process how you generated and pruned the candidate association rules (do not use brute force candidate rule generation approach). [Assume that both the Minimum Support and the Minimum Confidence Threshold is 40% ] NOTE*: Please refer below to the BL - Bloom's Taxonomy Levels and mention the respective level in the questions
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
