Heavens Light is Our Guide

Rajshahi University of Engineering &

Technology
Department of Computer Science &
Engineering
Title: An Approach to Improve Apriori Algorithm for
Association Rule Mining
Presented by

Md. Jeyson Jaman Sawan

Roll No. 113019
Dept. of CSE, RUET
8/12/16

Supervised by
Rizoan Toufiq
Assistant Professor
Dept. of CSE, RUET
1

Agenda
Why this topic?
Objective
Association Rule Mining
An Example of Association Rule Mining
Steps of Association Rule Mining
Apriori Algorithm
Apriori Principle
Details Step of Apriori Algorithm
Algorithm
Example
Implementation
Limitation
Previous Improvement in Apriori Algorithm
Future Work
Conclusions
References
8/12/16

Why this topic????

Data Mining
Association Rules Mining
Transaction Database
Market Basket Analysis

8/12/16

Objective
Implement Apriori Algorithm
Finding out the limitations of this
classical Apriori algorithm
Improving this algorithm by
reducing these limitations
Comparing this improved Apriori
algorithm with classical Apriori
algorithm
Comparing this improved Apriori
algorithm with others improved
Apriori algorithm
8/12/16

Association Rule Mining

Finding frequent patterns,
associations, correlations,
or objects in transaction
databases, relational
databases, and other
information repositories
Finding relationship
between seemingly
unrelated data[2]
Using support and
confidence to identify
8/12/16

Basket data
analysis
crossApplicati
marketing
on
clustering
classification
etc.

Association Rule Mining(cont.)

A rules support in a
transaction set is the
percentage of
transactions which
contain [12]
A rules confidence in a
transaction set is the
percentage of
transactions which
contain also contain [12]
8/12/16

Support

Confidence

An example Association Rule Mining

Transaction data[13]
Assume:
minimum support = 30%
minimum confidence = 80%

An example frequent itemset:

{Chicken, Clothes, Milk}

[support = 3/7]

t1: Beef, Chicken, Milk

t2: Beef, Cheese
t3: Cheese, Boots
t4: Beef, Chicken, Cheese
t5: Beef, Chicken, Clothes,
Cheese, Milk
t6: Chicken, Clothes, Milk
t7: Chicken, Milk, Clothes

Association rules from the itemset:

Clothes Milk, Chicken [support = 3/7, confidence = 3/3]

Clothes, Chicken Milk, [support = 3/7, confidence = 3/3]

8/12/16

An Example Association Rule

Mining(cont.)

Brute Force
Approach[3]

Number of rules:
R=

Where,
d=number of
items
Here,
d=6

Too
Many!!!!
8/12/16

Steps of Association Rule Mining

Ste
ps

Frequent
item set
generation
Brute
Force
Approac
h
Apriori
Algorith
m

Rule
generation

My
concern

FPGrowth
8/12/16

Apriori Algorithm
Developed by Agrawal
and Srikant 1994[10]
Innovative way to find
association rules on large
scale, allowing implication
outcomes that consist of
more than one item
Based on minimum
support threshold
8/12/16

Steps
Candidate
Generation
Frequent
Item Set
Generation
10

Apriori Algorithm (cont.)

Frequent Item Set[1]
The sets of items that
have minimum support
Level-wise algorithm

Reducing complexity-Apriori
Use generate-and-test
Algorithm

strategy

reducing # of
candidate
Computatio item set
nal
reducing # of
Complexity
comparisons
Reducing

More
effective

8/12/16

11

Apriori Algorithm (cont.)

Candidate Item
Set[3]

Step
s
8/12/16

Candidate
Generatio
n
Candidate
s pruning

Procedu
re
Brute
Force
Method

Method

* Method

Efficient
[3]

12

Apriori Principle

downward closure
property[3].
If an itemset is frequent,
then all of its subsets must
also be frequent
if an itemset is not
frequent, any of its
superset is never frequent
8/12/16

Fig 1: Apriori
Principle [3]

13

Details Steps of Apriori Algorithm

8/12/16

Fig 2: Steps[14]

14

Algorithm
Algorithm Apriori(T)[10]
C1 init-pass(T);
F1 {f | f C1, f.count/n minsup};

// n: no. of transactions in T

for (k = 2; Fk-1 ; k++) do

Ck candidate-gen(Fk-1);
for each transaction t T do
for each candidate c Ck do
if c is contained in t then
c.count++;
end
end
Fk {c Ck | c.count/n minsup}
end
return F k Fk;
8/12/16

15

Candidate-gen function
Function candidate-gen(Fk-1) [10]
Ck ;
forall f1, f2 Fk-1
with f1 = {i1, , ik-2, ik-1}
and f2 = {i1, , ik-2, ik-1}
and ik-1 < ik-1 do
c {i1, , ik-1, ik-1};

// join f1 and f2

Ck Ck {c};
for each (k-1)-subset s of c do
if (s Fk-1) then
delete c from Ck; // prune
end
end
return Ck;
8/12/16

16

Example

8/12/16

Min_sup=2

Fig 3:
Example[11]

17

Implementation
For various data set, we have..
Data Set[17] No of Items

No of
Transaction

Min_sup(%)

No of
Frequent
ItemSet

Execution
Time(sec)

4
2

Simple

50

Zoo

17

101

50

Tic Toc Toe

958

16

0.062

100

Table1: Frequent ItemSet

1000
50 and
Number Counting
Execution Time Measuring

2
4

4
5

0.312

Synthetic

8/12/16

0.0
0.016

18

Limitation
Very slow and the bottleneck in
candidate generation.
Candidate generation could generate
duplicates depending on the
implementation
To compute those with sup more than
min sup, the database need to be
scanned at every level. It needs (n +1 )
scans, where n is the length of the
longest pattern.
Huge memory consumption
8/12/16

19

Previous Improvement in Apriori

Algorithm
Reducing candidate itemset by
comparing two candidate
itemset[1]
Improvement by reducing
candidate set and memory
utilization[2]
Improvement based on set size
frequency[9]
Improvement by reducing
redundant operation[15]
Utilization of resources[16]
8/12/16

20

Future Work
Improvement- by
reducing the number of
transactions to be
Scanned
Comparing performance
with classical algorithm
Comparing performance
with other improved
algorithm
8/12/16

21

Conclusions

Apriori Algorithm will be

more efficient by reducing
its limitations
Reducing limitationsChallenging
Hard effort, study-good
result
8/12/16

22

References
[1] Mohammed Al-Maolegi, Bassam Arkok , 2014, An Improved Apriori Algorithm for
Association Rules, International Journal on Natural Language Computing(IJNLC) Vol. 3,
No.1, February 2014
[2] Sakshi Aggarwal, Ritu Sindhu, 2015, An Approach of Improvisation in Efficiency of
Apriori Algorithm, International Journal of Computer and Communication System
Engineering (IJCCSE), Vol. 2 (5), 2015, 659-664 659
[3] J. Han, M. Kamber,Data Mining: Concepts and Techniques, Morgan Kaufmann
Publishers, Book, 2000
[4] Michael Steinbach, Pang-Ning Tan, and Vipin Kumar, 2006, Introduction to Data
Mining
[5] Chanchal Yadav, Shuliang Wang, Manoj Kumar, 2013, An Approach to Improve
Apriori Algorithm Based On Association rule Mining,Fourth International Conference on
Computing, Communications and Networking Technologies (ICCCNT),IEEE Computer
Society
8/12/16

23

References
[6] Darshan M. Tank, 2014, Improved Apriori Algorithm for Mining Association
Rules, I.J. Information Technology and Computer Science, 2014, 07, 15-23
[7] Jagmeet Kaur, Neena Madan, 2015, Review of Apriori Algorithm and its Recent
Improvements, International Journal of Emerging Technologies in Computational and
Applied Sciences, 12(2), March-May 2015, pp. 150-152
[8] Ms. Rina Raval, Prof. Indr Jeet Rajput, Prof. Vinitkumar Gupta, 2013, Survey on
several improved Apriori algorithms, IOSR Journal of Computer Engineering (IOSRJCE)e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 9, Issue 4 (Mar. - Apr. 2013), PP 5761
[9] Sheila A. Abaya, Association Rule Mining based on Apriori Algorithm in Minimizing
Candidate Generation, :International Journal of Scientific & Engineering Research
Volume 3, Issue 7, July-2012
[10] Rakesh Agarwal, Ramakrishna Srikant, Fast Algorithm for mining association
rules VLDB Conference Santiago, Chile, 1994, pp 487-499
8/12/16

24

References
[11] Example,http://images.slideplayer.com/15/4688193/slides/slide_23.jpg.
[12] Charu C. Aggarwal, Data Classification: Algorithms and Applications, Business &
Economics, Book, 2014.
[13] Association Rules, web.cs.iastate.edu/~weile/cs641/10.AssociateRules.ppt.
[14] Steps, http://image.slidesharecdn.com/apriorialgorithm-140619035225phpapp02/95/apriori-algorithm-5-638.jpg?cb=1403150201.
[15] Yanfei Zhou, Wanggen Wan, Junwei Liu, Long Cai, Mining Association Rules Based
on an Improved Apriori Algorithm, 978-1-4244-585 8- 5/10/$26.00 2010 IEEE.
[16] Mamta Dhanda, Sonali Guglani , Gaurav Gupta, Mining Efficient Association
Rules Through Apriori Algorithm Using Attributes, International Journal of
Computer Science and Technology Vol 2,Issue 3,September 2011,ISSN:0976-8491
[17] Dataset,http://www2.cs.uregina.ca/~dbd/cs831/notes/itemsets/datasets.php

8/12/16

25

8/12/16

26