To Suggest Products To Customers Using

Sequential Sequence Mining

(APRIORI ALGORITHM)

-Mr. Deepak Sharma

(Mentor)
CONTENT
A
1 ABSTRACT
2 INTRODUCTION
OO OBJECTIVES
3
OO DESIGN
4

5 IMPLEMENTATION
ABSTRACT
 APRIORI ALGORITHM
‘’ Apriori algorithm is a seminal algorithm
designed to operate on database
containing transactions for mining frequent
itemsets and extending them to larger and
larger item sets as long as those item sets
appear sufficiently often in the database. ’’
 .

• Using the Apriori algorithm, the number of item sets that

has to be examined can be pruned and the list of popular
itemsets can be obtained.

• We will be applying the different variations of Apriori

algorithm to collect the varying frequent itemsets of a
retails store season wise and to suggest products
depending upon the common pattern obtained.
INTRODUCTION
• Apriori is an algorithm for frequent item set mining over
transactional databases.
• Massive amounts of data continuously being collected and
stored, many industries are becoming interested in mining
such patterns from their databases.

• A typical example of frequent itemset mining is market basket

analysis. This process analyzes customer buying habits by
finding associations between the different items that
customers place in their “shopping baskets”.
OBJECTIVES
 To implement Apriori Algorithm
Partitioning
To suggest products to customers using
frequent itemsets obtained season-wise.
Sampling
To implement different variations of
Apriori algorithm in order to improve
the efficiency.
DESIGN
IMPLEMENTATION
 Steps To Perform Apriori Algorithm
Use Lk-1 join Lk-1
to generate a set of candidate k- Scan the transaction database to get the
itemset. And use Apriori property support S of each candidate k-itemset in
to prune the unfrequented k- the find set, compare S with min_sup,
itemset from this sets and get a set of frequent k-itemset Lk
Scan the transaction database to
get the support of S each 1- A B
itemset

C D For every nonempty subset s of

For each frequent itemset 1, 1,output the rule “s=>(1-s)” if
generate all nonempty subsets confidence C of the “s=>(1-
of 1 s)”(=support s of1/support S of s)’
min_conf
 Steps To Perform Partitioning
•Divide the database into n partitions.

•Find frequent itemsets local to each partition

•Combine all local frequent itemsets to form candidate

itemsets.

•Find global frequent itemsets among candidate itemsets

 Steps To Perform Sampling

• Select a random sample of fewer transactions from the database.

• Apply basic Apriori algorithm on the sample dataset.

• Assume the support count to be a smaller value than the general support-count.

• Find frequent itemset from the sample dataset.

• Now the obtained itemset can be considered as the global itemset for the
complete transactional database.
THANK YOU
Ayush Rathore
Rishika Bhatia
Varnika Chauhan