Scribd
Upload
126 views15 pages

Apriori Algorithm

The Apriori algorithm is used to find frequent itemsets and generate association rules from transactional databases. It works by identifying frequent itemsets in the database based on a minimum support threshold, and then generating association rules from these itemsets that meet a minimum confidence threshold. The algorithm uses a breadth-first search approach and performs multiple passes over the database to generate candidate itemsets of increasing size.

Uploaded by

Hemant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
126 views15 pages

Apriori Algorithm

The Apriori algorithm is used to find frequent itemsets and generate association rules from transactional databases. It works by identifying frequent itemsets in the database based on a minimum support threshold, and then generating association rules from these itemsets that meet a minimum confidence threshold. The algorithm uses a breadth-first search approach and performs multiple passes over the database to generate candidate itemsets of increasing size.

Uploaded by

Hemant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Apriori Algorithm

Dr. Sarvesh Vishwakarma


Apriori Algorithm
• The Apriori algorithm uses frequent itemsets to generate association
rules, and it is designed to work on the databases that contain
transactions.
• With the help of these association rule, it determines how strongly or
how weakly two objects are connected.
• This algorithm uses a breadth-first search and Hash Tree to
calculate the itemset associations efficiently.
• It is the iterative process for finding the frequent itemsets from the
large dataset.

Dr. Sarvesh Vishwakarma


Apriori Algorithm (Application Area)
• It is mainly used for market basket analysis and helps to find those
products that can be bought together.
• It can also be used in the healthcare field to find drug reactions for
patients.

Dr. Sarvesh Vishwakarma


Apriori Algorithm
What is Frequent Itemset?

• Frequent itemsets are those items whose support is greater than the
threshold value or user-specified minimum support.
• It means if A & B are the frequent itemsets together, then individually
A and B should also be the frequent itemset.
• Suppose there are the two transactions: A= {1,2,3,4,5}, and B=
{2,3,7}, in these two transactions, 2 and 3 are the frequent itemsets.

Dr. Sarvesh Vishwakarma


Steps for Apriori Algorithm
1. Determine the support of itemsets in the transactional database, and
select the minimum support and confidence.
2. Take all supports in the transaction with higher support value than
the minimum or selected support value.
3. Find all the rules of these subsets that have higher confidence value
than the threshold or minimum confidence.
4. Sort the rules as the decreasing order of lift.

Dr. Sarvesh Vishwakarma


Apriori Algorithm Working
Example: Suppose we have the following dataset that has various
transactions, and from this dataset, we need to find the frequent itemsets
and generate the association rules using the Apriori algorithm:
TID ITEMSETS
T1 A, B Given:
T2 B, D Minimum Support = 2
Minimum Confidence = 50%
T3 B, C
T4 A, B, D
T5 A, C
T6 B, C
T7 A, C
T8 A, B, C, E
T9 A, B, C
Dr. Sarvesh Vishwakarma
Step-1: Calculating C1 and L1:
In the first step, we will create a table that contains support count (The
frequency of each itemset individually in the dataset) of each itemset in
the given dataset. This table is called the Candidate set or C1.
ITEMSET SUPPORT_COUNTS
A 6
B 7
C 5
D 2
E 1

Dr. Sarvesh Vishwakarma


Step-1: Calculating C1 and L1:
Now, we will take out all the itemsets that have the greater support
count that the Minimum Support (2). It will give us the table for
the frequent itemset L1.
Since all the itemsets have greater or equal support count than the
minimum support, except the E, so E itemset will be removed.
ITEMSET SUPPORT_COUNTS
A 6
B 7
C 5
D 2

Dr. Sarvesh Vishwakarma


Step-2: Candidate Generation C2, and L2:
• In this step, we will generate C2 with the help of L1. In C2, we will
create the pair of the itemsets of L1 in the form of subsets.
• After creating the subsets, we will again find the support count from
the main transaction table of datasets, i.e., how many times these pairs
have occurred together in the given dataset. So, we will get the below
table for C2: ITEMSET SUPPORT_COUNTS
{A, B} 4
{A, C} 4
{A, D} 1
{B, C} 4
{B, D} 2
{C, D} 0
Dr. Sarvesh Vishwakarma
Step-2: Candidate Generation C2, and L2:
• Again, we need to compare the C2 Support count with the minimum
support count, and after comparing, the itemset with less support count
will be eliminated from the table C2. It will give us the below table for
L2

ITEMSET SUPPORT_COUNTS
{A, B} 4
{A, C} 4
{B, C} 4
{B, D} 2

Dr. Sarvesh Vishwakarma


Step-3: Candidate generation C3, and L3:
• For C3, we will repeat the same two processes, but now we will form
the C3 table with subsets of three itemsets together, and will calculate
the support count from the dataset. It will give the below table:
ITEMSET SUPPORT_COUNTS
{A, B, C} 2
{B, C, D} 0
{A, C, D} 0
{A, B, D} 0

• Now we will create the L3 table. As we can see from the above C3
table, there is only one combination of itemset that has support count
equal to the minimum support count. So, the L3 will have only one
combination, i.e., {A, B, C}. Dr. Sarvesh Vishwakarma
Step-4: Finding the association rules for the
subsets:
To generate the association rules, first, we will create a new table
with the possible rules from the occurred combination {A, B.C}.
For all the rules, we will calculate the Confidence using formula
sup( A ^B)/A. After calculating the confidence value for all rules,
we will exclude the rules that have less confidence than the
minimum threshold(50%).

Dr. Sarvesh Vishwakarma


Consider the below table:

As the given threshold or minimum confidence is 50%, so the first three


rules A ^B → C, B^C → A, and A^C → B can be considered as the strong
association rules for the given problem.
Dr. Sarvesh Vishwakarma
Advantages of Apriori Algorithm
• This is easy to understand algorithm
• The join and prune steps of the algorithm can be easily implemented
on large datasets.

Dr. Sarvesh Vishwakarma


Disadvantages of Apriori Algorithm
• The apriori algorithm works slow compared to other algorithms.
• The overall performance can be reduced as it scans the database for
multiple times.
• The time complexity and space complexity of the apriori algorithm is
O(2D), which is very high. Here D represents the horizontal width
present in the database.

Dr. Sarvesh Vishwakarma

You might also like