Find all frequent item sets using apriori algorithm. List strong association rules.

Apriori Algorithm

The given Minimum Support = 50 %

The Number of Transactions = 4

Therefore,

The Minimum Support = $ 0.5 \times 4 = 2 $

Step 1 - Calculate the Minimum Count for each Item.

Therefore,

Step 2 - Delete the items that do not have a minimum support count of 2.

Therefore, Items D, E, and F are deleted.

Step 3 - Combine 2-items and find out the Minimum Count of the occurrences of the 2-items.

Now, got the only item-set {A,C} that is frequent.

Step 4 - Generate Association Rules from the frequent itemset discovered in the above step - 3.

Rule 1 - {A} => {C}

$$ Confidence = \frac{Support\{A,C\}}{Support\{A\}} = \frac 23 \times 100 = 66.67\ \% $$

Rule 2 - {C} => {A}

$$ Confidence = \frac{Support\{A,C\}}{Support\{C\}} = \frac 22 \times 100 = 100\ \% $$

The given Minimum Confidence = 50 %

Therefore,

This shows that all the above Association Rules are Strong.