Apriori Algorithm
The given Minimum Support Count = 2
Step 1 - Calculate the Minimum Count for each Item.
Therefore,
Items |
Minimum Count |
1 |
7 |
2 |
6 |
3 |
6 |
4 |
2 |
5 |
2 |
Step 2 - Delete the items that do not have a minimum support count of 2.
But, here all items have a minimum support count of 2 therefore, no need to delete any item.
Step 3 - Combine 2-items and find out the Minimum Count of the occurrences of the 2-items.
Therefore,
Items |
Minimum Count |
1, 2 |
4 |
1, 3 |
5 |
1, 4 |
1 |
1, 5 |
2 |
2, 3 |
3 |
2, 4 |
2 |
2, 5 |
2 |
3, 4 |
0 |
3, 5 |
1 |
4, 5 |
0 |
Step 4 - Delete the group of 2-items that do not have a minimum support count of 2.
Therefore,
Items |
Minimum Count |
1, 2 |
4 |
1, 3 |
5 |
1, 5 |
2 |
2, 3 |
3 |
2, 4 |
2 |
2, 5 |
2 |
Step 5 - Combine 3-items and find out the Minimum Count of the occurrences of the 3-items.
Therefore,
Items |
Minimum Count |
1, 2, 3 |
2 |
1, 2, 4 |
1 |
1, 2, 5 |
2 |
1, 3, 4 |
0 |
1, 3, 5 |
1 |
1, 4, 5 |
0 |
Step 6 - Delete the group of 3-items that do not have a minimum support count of 2.
Therefore,
Items |
Minimum Count |
1, 2, 3 |
2 |
1, 2, 5 |
2 |
Now, got the two item-sets {1, 2, 3} and {1, 2, 5} that are frequent.
Association Rule Mining
Generate Association Rules from the frequent itemset {1, 2, 3} and {1, 2, 5}.
Association Rules for frequent itemset {1, 2, 3} -
Rule 1 - {1, 2} => {3}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{1, 2\}} = \frac 24 \times 100 = 50\ \% $$
Rule 2 - {1, 3} => {2}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{1, 3\}} = \frac 25 \times 100 = 40\ \% $$
Rule 3 - {2, 3} => {1}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{2, 3\}} = \frac 23 \times 100 = 66.67\ \% $$
Rule 4 - {3} => {1, 2}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{3\}} = \frac 26 \times 100 = 33.34\ \% $$
Rule 5 - {2} => {1, 3}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{2\}} = \frac 26 \times 100 = 33.34\ \% $$
Rule 6 - {1} => {2, 3}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{1\}} = \frac 27 \times 100 = 28.57\ \% $$
Association Rules for frequent itemset {1, 2, 5} -
Rule 1 - {1, 2} => {5}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{1, 2\}} = \frac 24 \times 100 = 50\ \% $$
Rule 2 - {1, 5} => {2}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{1, 5\}} = \frac 22 \times 100 = 100\ \% $$
Rule 3 - {2, 5} => {1}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{2, 5\}} = \frac 22 \times 100 = 100\ \% $$
Rule 4 - {5} => {1, 2}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{5\}} = \frac 22 \times 100 = 100\ \% $$
Rule 5 - {2} => {1, 5}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{2\}} = \frac 26 \times 100 = 33.34\ \% $$
Rule 6 - {1} => {2, 5}
$$ Confidence = \frac{Support\{1, 2, 3\}}{Support\{1\}} = \frac 27 \times 100 = 28.57\ \% $$
The given Minimum Confidence = 70 %
Therefore,
Association Rules |
Confidence |
{1, 5} => {2} |
100 % |
{2, 5} => {1} |
100 % |
{5} => {1, 2} |
100 % |
above three rules that have the confidence more than 70 % are considered Strong Association Rules.