Scribd
Upload
296 views

Apriori Algorithm Example Problems

The Apriori algorithm is used to find frequent itemsets and generate association rules. It works by identifying frequent itemsets in a dataset, where a frequent itemset is an itemset that appears with frequency greater than a user-specified minimum support threshold. The algorithm uses the property that any subset of a frequent itemset must also be frequent, to prune the search space and count itemset supports efficiently. It generates association rules from the frequent itemsets that satisfy a minimum confidence threshold.

Uploaded by

harijillukrish0108
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
296 views

Apriori Algorithm Example Problems

The Apriori algorithm is used to find frequent itemsets and generate association rules. It works by identifying frequent itemsets in a dataset, where a frequent itemset is an itemset that appears with frequency greater than a user-specified minimum support threshold. The algorithm uses the property that any subset of a frequent itemset must also be frequent, to prune the search space and count itemset supports efficiently. It generates association rules from the frequent itemsets that satisfy a minimum confidence threshold.

Uploaded by

harijillukrish0108
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Apriori Algorithm

Apriori algorithm uses frequent itemsets to generate association rules. It is based on the concept
that a subset of a frequent itemset must also be a frequent itemset. Frequent Itemset is an itemset
whose support value is greater than a threshold value(support).

Example-1:

Iteration 1: Let’s assume the support value is 2 and create the item sets of the size of 1 and
calculate their support values.

As you can see here, item 4 has a support val


value
ue of 1 which is less than the min support value. So
we are going to discard {4} in the upcoming iterations. We have the final Table F1.
Iteration 2: Next we will create itemsets of size 2 and calculate their support values. All the
combinations of items
ms set in F1 are used in this iteration.

Itemsets having Support less than 2 are eliminated again. In this case {1,2}. Now, Let’s
understand what is pruning and how it makes Apriori one of the best algorithm for finding
frequent itemsets.

Pruning: We are going to divide the itemsets in C3 into subsets and eliminate the subsets that
are having a support value less than 2.
Iteration 3: We will discard {1,2,3} and {1,2,5} as they both contain {1,2}. This is the main
highlight of the Apriori Algorithm
Algorithm.

Iteration 4: Using sets of F3 we will create C4.

Since the Support of this itemset is less than 2, we will stop here and the final itemset we will
have is F3.
Note: Till now we haven’t calculated the confidence values yet.

With F3 we get the following itemsets:

For I = {1,3,5},, subsets are {1,3}, {1,5}, {3,5}, {1}, {3}, {5}
For I = {2,3,5},, subsets are {2,3}, {2,5}, {3,5}, {2}, {3}, {5}

Applying Rules: We will create rules and apply them on itemset F3. Now let’s assume a
minimum confidence value is 60%.

For every subsets S of I, you output the rule

 S –> (I-S)
S) (means S recommends II-S)
 if support(I) / support(S) >= min_conf value
{1,3,5}
Rule 1: {1,3} –> ({1,3,5} – {1,3}) means 1 & 3 –> 5
Confidence = support(1,3,5)/support(1,3) = 2/3 = 66.66% > 60%
Hence Rule 1 is Selected

Rule 2: {1,5} –> ({1,3,5} – {1,5}) means 1 & 5 –> 3


Confidence = support(1,3,5)/support(1,5) = 2/2 = 100% > 60%
Rule 2 is Selected

Rule 3: {3,5} –> ({1,3,5} – {3,5}) means 3 & 5 –> 1


Confidence = support(1,3,5)/support(3,5) = 2/3 = 66.66% > 60%
Rule 3 is Selected

Rule 4: {1} –> ({1,3,5} – {1}) means 1 –> 3 & 5


Confidence = support(1,3,5)/support(1) = 2/3 = 66.66% > 60%
Rule 4 is Selected

Rule 5: {3} –> ({1,3,5} – {3}) means 3 –> 1 & 5


Confidence = support(1,3,5)/support(3) = 2/4 = 50% <60%
Rule 5 is Rejected

Rule 6: {5} –> ({1,3,5} – {5}) means 5 –> 1 & 3


Confidence = support(1,3,5)/support(5) = 2/4 = 50% < 60%
Rule 6 is Rejected
EXAMPLE-2
Consider the transaction dataset of a store where each transaction contains the list of items
purchased by the customers. Our goal is to find frequent set of items that are purchased by the
customers and generate the association rules for them.

We are assuming that minimum support count is 2 and minimum confidence is 50%.

Step 1: Create a table which has support count of all the items present in the transaction
database.

We will compare each item’s support count with the minimum support count we have set. If the
support count is less than minimum support count then we will remove those items.

Support count of I4 < minimum support count.


Step 2: Find all the superset with 2 items of all the items present in the last step.
Check all the subset of an itemset which are frequent or not and remove the infrequent ones. (
For example subset of { I2, I4 } are { I2 } and { I4 }but since I4 is not found as frequent in
previous step so we will not consider it ).

Since I4 was discarded in previous one, so we are not taking any superset having I4

Now, remove all those itemset which has support count less than minimum support count. So,
the final dataset will be

Step 3: Find superset with 3 items in each set present in last transaction dataset. Check all the
subset of an itemset which are frequent or not and remove the infrequent ones.

In this case if we select { I1, I2, I3 } we must have all the subset that is,
{ I1, I2 }, { I2, I3 }, { I1, I3 }. But we don’t have { I1, I3 } in our dataset. Same is true for { I1,
I3, I5 } and { I2, I3, I5 }.

So, we stop here as there are no frequent itemset present.

Step 4: As we have discovered all the frequent itemset. We will generate strong association rule.
For that we have to calculate the confidence of each rule.

All the possible association rules can be,


1. I1 -> I2
2. I2 -> I3
3. I2 -> I5
4. I2 -> I1
5. I3 -> I2
6. I5 -> I2

So, Confidence( I1 -> I2 ) = SupportCount ( I1 U I2 ) / SupportCount( I1 )


= (2 / 2) * 100 % = 100%.

Similarly we will calculate the confidence for each rule.

Since, All these association rules has confidence ≥50% then all can be considered as strong
association rules.

Step 5: We will calculate lift for all the strong association rules.

Lift ( I1 -> I2 ) = Confidence( I1 -> I2 )/ Support( I2 ) = 100 / 4 = 25 %.

Now we will sort the Lift in decreasing order.

You might also like