International Journal of Advanced Engineering Research and Technology (IJAERT) 178

Volume 3 Issue 4, April 2015, ISSN No.: 2348 8190

Comparative Analyses of Different Association Rule Mining Algorithm

Satindra G Padwal
M.E. Student, Department of
Information Technology
PIET, Limda, India

Dheeraj Kumar Singh

Asst. Professor, Department of
Information Technology
PIET, Limda, India

Abstract
Large amount of the data available in the world weather
it is online or offline. This large data needs to process so
that we can gain some useful information from that data.
For this purpose we have to do mining over that data.
Data mining is the technique that processes the data,
integrate and retrieve some useful information from that
data. Data mining is the tool through which we can
allow user to analyze the data and it also discover the
useful information from large database for relational
database. Data mining can perform these various
activities
using
itstechnique
like
clustering,
classification, prediction, associationlearning etc.This
paper presents an overview of association rule mining
algorithms. Algorithms are present with example and
compare base on the parameter like accuracy, speed of
an algorithm and data support.
Keywords: association rule mining, Apriori, Aprioritid,
AprioriHybrid, fp-growth, LogEclat.

I.

INTODUCTION

Association rule mining is an active or popular method

in the data mining field, which is the key step in the
KDD process. Association rule mining may finds
interesting relation, frequent pattern or dependency
relation between item sets among large data based on
predefined minimum support and minimum confidence.
Mining association rule problem is decomposed into two
sub problem. First is to find out those itemsets that will
satisfy minimum support, this itemsets are called
frequent itemset. And second problem is to find
association rule from those itemset with constrain of
minimum confidence.
Let say I=I1,I2,I3,,Imbe set of items, T be transaction
that contains a set of items such that TI, D be the
database that contain different transaction records. An
association is an implication of the form XY, where X,
Y I are set of item called itemsets, and X Y = .
There are two important measures for association rule,
support and confidence.

Generally association rule mining contains following

steps:
i. The set of candidate k-itemsets is generated by 1extensions of the large (k -1) itemsets generated in the
previous iteration.
ii. Supports for the candidate k-itemsets are generated by
a pass over the database.
iii. Itemsets that do not have the minimum support are
discarded and the remaining itemsets are called large kitemsets.

II.

APRIORI ALGORITHM

Apriori algorithm is used for frequent item set mining

and association rule learning and it is proposed by R.
Agrawal and R.Srikant in 1994. Thealgorithm uses
level-wise search, where k-itemsets are used to explore
(k+1)- itemsets. In this algorithm frequent set are
extended one item at a time and this is known as
candidate generation process.
A two steps process is followed by this algorithm
consisting of join and prune[5].
Join Step: Ck is generated by joining Lk-1 with itself.
Prune Step:Any (k-1)-itemset that is not frequent
cannot be a subset of a frequent k-itemset
Algorithm Pseudocode
Apriori (T, minSupport){ //T is the database and
minSupport is the minimum support
L1= {frequent items};
For(k=2;Lk-1!=; k++){
Ck= candidate generated from Lk-1
// that is Cartesian product Lk-1 X Lk-1
and
eliminating any k-1 size itemset that is not frequent
for each transaction t in database do{
Increment the count of all candidate in Ck
Lk = candidates in Ck with minSupport
}// end for each
}//end for
return UkLk;

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 179

Volume 3 Issue 4, April 2015, ISSN No.: 2348 8190

Items
A
B
C
D
E
F

Count
Number
2
3
1
4
3
4

Large 2 Items
BD
BF
DE
DF

Large 1
Items
B
D
E
F

Items

Count

BD

BE

BF

DE

DF

EF

Items

Count

BDF

DEF

process of frequent pattern generation i.e. construction of

fp-tree and generation of frequent pattern from it.
Fp-tree is constructed using two passed over the
database are as follow[9]:
Pass I:
1. Scan the database and find the count of each
item.
2. Discard the infrequent items based on
minSupport.
3. Sort the frequent items in descending order
based on their support.
Pass II:
1. Here nodes are the items with count.
2. FP-growth reads one transaction at a time and
then the its path.
3. The order that it used is fixed, so that path can
overlap when transactions shared the items.

EF

Table 1 to 5: Example of Apriori Algorithm [7]

There are two drawback of the Apriori algorithm [1]. First
is that it requires multiple scan over the database. And
second is it must spend a lot of time to deal with huge
candidate item sets.

III.

AprioriTID ALGORITHM

In this algorithm, database D is not used for counting

support of the candidate itemset after first pass [1]. This
algorithm uses the candidate generation function which
is same as the Apriori algorithm and the process of that
candidate generation is also same.

IV.

AprioriHybrid ALGORITHM

As we know that Apriori does better in earlier phase than

AprioriTid and AprioriTid does better in later phase than
Apriori [2]. So the new algorithm i.e. AprioriHybrid
combine both the algorithm, use Apriori in earlier phase
and used AprioriTid in later phase of the database.

V.

In this case, counters are incremented. Some pointers

aremaintained between nodes which contain the same
item, by creating singly linked lists. The more paths that
overlap,higher the compression. FP-tree may fit in
memory. Finally,frequent itemsets are extracted from the
FP-Tree.
Procedure FP-Growth(Tree T, A)
{
1) If Tree T contains a single path P
2) for each combination (denoted as ) of the nodes in
the path p
3) generate pattern U with support count = minimum
support count of nodes in
4) else for each aj in the header of Tree{
5) generate pattern = aj U with support count =
aj.support count;
6) construct conditional pattern base and then s
conditional Fp-Tree
7) if Tree =0
8) call FP growth(Tree , );
}

VI.

FP-Growth ALGORITHM

To overcome the limitation of the Apriori algorithm, FpGrowth is used. It uses the divide and conquers strategy.
This algorithm required two passes over the database
[9][3]
. In the first scan it derives the frequent items with
their support count.The set of frequent items is sorted in
the order of descending support count. There are two sub

LogEclat ALGORITHM

LogEclat is algorithm used to discover the frequent

itemset from the database. It has same theoretical base as
Apriori algorithm[4]. Different between these two
algorithms is, Apriori is based on the horizontal layout
and LogEclat is based on the vertical layout. Advantage
of LogEclat is it does not require to scan whole database
each time like Apriori instead it scan only updated

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 180

Volume 3 Issue 4, April 2015, ISSN No.: 2348 8190

database[7]. LogEclat algorithm uses candidates selected

from combination which are produced by every two
different itemsets in Lk to scan database Dk. Example of
this algorithm is given below:
Table 1 Database
TID ITEMS
T1
A,B,D,F,H
T2
A,C,D,E,F
T3
B,D,E,F,H
T4
B,D,E,F

L1
B
D
E
F

Table 2 Count of each item

Table 3 L1
Count
3
4
3
4

Table 5 Combination
I1
I2
I3
B
D
BD
B
E
BE
B
F
BF
D
E
DE
D
F
DF
E
F
EF

ITEMS
A
B
C
D
E
F
H

Count
2
3
1
4
3
4
2

Table 4 New database

ITEMS
Recording
B
T1,T3,T4
D
T1,T2,T3,T4
E
T2.T3.T4
F
T1,T2,T3,T4

L2
BD
BF
DE
DF
EF

Table 7 New database

Itemset
Recording
BD
T1,T3,T4
BF
T1,T3,T4
DE
T2,T3,T4
DF
T1,T2,T3,T4
EF
T2,T3,T4

Table 6 L2
Count
3
3
3
4
3

Table 8 L3
L3
Count
BDF
3
DEF
3

Table 1to 8: Example of LogEclat algorithm[7]

Figure 1: Pseudocode for LogEclat[7]

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 181

Volume 3 Issue 4, April 2015, ISSN No.: 2348 8190

VII.

algorithms. Comparison is based on the criteria like

accuracy, speed of an algorithm, database support etc.
Each algorithm has some advantages and disadvantages
like Apriori takes more time to execute the algorithm
and does not perform well on large datasets while
disadvantage of Fp-Growth is its complex tree structure
which increases the complexity of an algorithm. Based
on that criteria we can conclude that LogEclat algorithm
perform better than other algorithm.

COMPARISON TABLE

Table 9 Comparison between different algorithms

Algorithm
Merits
Demerits
Name
Apriori
- Fast
- Takes lots of
- Less
memory
Candidate Set
AprioriTid
- Better then
- Takes more
Apriori
time
- Time saving incandidate
generation on
large dataset
AprioriHybrid -Better than
- Less
both Apriori
efficient then
and
Eclat
AprioriTID
Fp-Growth
-fast than
-Using tree
Apriori
structure
creates
complexity
LogEclat
-more
- takes more
efficient than
time on steam
other
data
algorithms

REFERENCES
[1] Trupti A. Kumbhare Prof. Santosh V. Chobe,
An
Overview
of
Association
Rule
MiningAlgorithms, 2014International Journal
of Computer Science and Information
Technologies
[2] Manisha
Girotra,Kanika
Nagpal,Saloni
Minocha,Neha Sharma, "Comparative Survey on
Association Rule Mining Algorithms", 2013
International Journal of Computer Applications.
[3] Komal Khurana, Mrs. Simple Sharma, "A
Comparative Analysis of Association Rules
Mining Algorithms", 2013 International Journal
ofScientific and Research Publications.
[4] S.Vijayarani,P.Sathya, "Mining Frequent Item
Sets over Data Streams using clat Algorithm",
2013 International Conference on Research
Trends in Computer Technologies.
[5] Parita Parikh Dinesh Waghela, "Comparative
Study of Association Rule Mining Algorithms",
2012 Parita Parikh et al, UNIASCIT, Vol 2 (1),
2012, 170-172.
[6] Goswami D.N.*, Chaturvedi Anshu, "An
Algorithm for Frequent Pattern Mining Based
OnApriori", 2010 International Journal on
Computer Science and Engineering.
[7] Kan Jin,"A new algorithm for discovering
association rules", 2010 IEEE.
[8] Z.Liu, AnalysisOptimization and Application
on the Algorithms ofMining Association Rules,
Shuzhou, 2007.
[9] Jiawei Han, Micheline Kamber and Jian Pei,
Data mining concepts and Techniques, Third
Edition.
.

Figure: Time to Execute the algorithm

VIII.

CONCLUSION

There are various association rule mining algorithms are

available. This paper represents the comparison of five
association rule mining algorithms i.e. Apriori,
AprioriTid, AprioriHybrid, Fp-Growth and LogEclate
www.ijaert.org