Professional Documents
Culture Documents
Available at http://www.ijcsonline.com/
Department of Computer Science & IT, Jammu University, Jammu and Kashmir India
Department of Computer Science & IT, Jammu University, Jammu and Kashmir India
Abstract
Data Mining or Knowledge Discovery is the process of discovering patterns in large data sets [1] in the form
databases and data warehouses in structured or unstructured manner. Association Rule Mining (ARM) is primarily
focused on analysing data for frequent if/then patterns and using the criteria support and confidence to identify the most
meaningful relationships. In the area of academic data mining, it concerns with developing methods for discovering
knowledge from data that come from Academic Enterprise Domain. There are several data mining algorithms pertaining
to association rules used both offline and online platforms. One of the most popular is FP growth that is used to extract
frequent itemsets from large database and generating the association rule for discovering the knowledge. In the proposed
research we have implemented an FP growth Algorithm implementation using Matlab and Dot Net Technologies using
an academic examination registration dataset. The various Association Rules have been used to mine valuable
knowledge regarding present, past and future course selection trends on subjects selected by the students at
undergraduate level. The results will provide an insight in making future decisions regarding proposing academic
infrastructure pertaining to human resource development/management, building of new departments/ centres, enhancing/
reducing intake capacity for a course/subject etc in an optimized manner.
Keywords: Association rule mining, Support, Confidence, Lift, FP Growth Algorithm
I.
INTRODUCTION
397 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Zunera Farooq et al
Association Rule Mining for Modelling Academic Resources using FP Growth Algorithm
B. FP growth Algorithm
The FP-Tree frequent pattern mining is used in the
development of association rule mining. FP-Tree
algorithm overcomes the problem found in Apriori
algorithm. By avoiding the candidate generation process
and less passes over the database, FP-Tree was found to be
faster than the Apriori algorithm [9]. It adopts a divide and
conquer strategy. Firstly it compresses the database
representing frequent items into a frequent pattern tree or
FP-tree. It retains the item set association information and
compressed databases are divided into a set of conditional
databases, each one associated with a frequent item. It
takes the help of prefix tree representation of the given
database of transactions (called FP tree), which saves
considerable amount of memory for storing the
transactions. An FP-Tree is a prefix tree for transactions.
Every node in the tree represents one item and each path
represents the set of transactions that involve with the
particular item. All nodes referring to the same item are
linked together in a list, so that all the transactions that
containing the same item can be easily found and counted.
Large databases are compressed into compact FP tree
structure. FP tree structure stores necessary information
about frequent item sets in a database [17].
FP-tree is constructed over the data-set using 2 passes are
as follows:
Pass 1:
1) Scan the data and find support for each item.
2) Discard infrequent items.
3) Sort frequent items in descending order which is based
on their support.
By using this order we can build FP-tree, so that common
prefixes can be shared.
Pass 2:
1) Here nodes correspond to items and it has a counter.
2) FP-growth reads one transaction at a time and then
maps it to a path.
3) Fixed order is used, so that paths can overlap when
transactions share the items.
In this case, counters are incremented. Some pointers are
maintained 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 [18].
III.
RELATED WORK
398 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Zunera Farooq et al
Association Rule Mining for Modelling Academic Resources using FP Growth Algorithm
3.
4.
5.
PROPOSED MODEL
FP GROWTH RESULTS
Association Rules
Support
Confidence
Lift
PS-->[GE,HS]
0.32134
0.75393
2.0119
[GE,PS]-->HS
0.32134
0.75393
2.0119
PS-->GE
0.42622
UR-->GE
0.50013
[ED,GE]-->UR
0.29507
0.72332
1.4463
[HS,PS]-->GE
0.32134
HS-->PS
0.32134
0.85752
2.0119
HS-->[GE,PS]
0.32134
0.85752
2.0119
[GE,HS]-->PS
0.32134
0.85752
2.0119
10
PS-->HS
0.32134
0.75393
2.0119
11
ED-->GE
0.40794
12
HS-->GE
0.37474
13
ED-->UR
0.29507
0.72332
1.4463
14
ED-->[GE,UR]
0.29507
0.72332
1.4463
[ED,UR]-->GE
0.29507
399 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Zunera Farooq et al
Association Rule Mining for Modelling Academic Resources using FP Growth Algorithm
Association
Rules
Support
Confidence
Lift
[BO,CH]-->GE
0.61993
[BO,CH,ZO]->GE
0.57108
ZO-->[CH,GE]
0.68002
0.93769
1.1245
BO-->[CH,GE]
0.61993
0.93769
1.1177
Association Rules
Support
Confidence
Lift
0.52408
0.52408
0.52408
MAB->[MD1,MD2,MD3]
[MAB,MD1]->[MD2,MD3]
[MAB,MD2]->[MD1,MD3]
MAB-->[MD1,MD3]
0.52408
[MAB,MD1]-->MD3
0.52408
MAB-->[MD2,MD3]
0.52408
[MAB,MD2]-->MD3
0.52408
[MAB,MD3]-->MD2
0.52408
MAI-->[MD1,MD3]
0.47592
10
[MAI,MD3]-->MD1
0.47592
11
MAI-->[MD2,MD3]
0.47592
12
[MAI,MD2]-->MD3
0.47592
13
[MAI,MD3]-->MD2
0.47592
14
MD1-->[MD2,MD3]
15
MAB-->[MD1,MD2]
0.52408
16
[MAB,MD1]-->MD2
0.52408
17
[MAB,MD2]-->MD1
0.52408
18
[MAB,MD1,MD2]->MD3
[MAB,MD3]->[MD1,MD2]
[MAB,MD1,MD3]->MD2
[MAB,MD2,MD3]->MD1
MAI->[MD1,MD2,MD3]
[MAI,MD2]->[MD1,MD3]
[MAI,MD1,MD2]->MD3
[MAI,MD3]->[MD1,MD2]
[MAI,MD1,MD3]->MD2
[MAI,MD2,MD3]->MD1
0.52408
0.52408
0.52408
0.52408
0.47592
0.47592
0.47592
0.47592
0.47592
0.47592
2
3
[BO,GE]-->CH
0.61993
0.93769
1.1177
[BO,ZO]->[CH,GE]
0.57108
0.92667
1.1112
BO->[CH,GE,ZO]
[BO,GE]->[CH,ZO]
[CH,GE,ZO]->BO
10
0.57108
0.57108
0.57108
0.85861
0.85861
0.8398
1.2626
1.2626
ZO->[BO,CH,GE]
0.57108
CH->[BO,GE,ZO]
0.57108
12
[CH,GE]->[BO,ZO]
0.57108
0.68483
1.1112
13
GE-->[BO,CH]
0.61993
0.61993
11
0.78747
1.2626
0.68483
1.2703
1.1112
19
20
21
22
23
24
25
26
27
400 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Zunera Farooq et al
Association Rule Mining for Modelling Academic Resources using FP Growth Algorithm
VI.
OBSERVATIONS
2.
3.
4.
5.
6.
401 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016
Zunera Farooq et al
Association Rule Mining for Modelling Academic Resources using FP Growth Algorithm
[14] Wang, H., Liu, P., & Li, H. (2014, June). Application of
improved association rule algorithm in the courses
management. In Software Engineering and Service Science
(ICSESS), 2014 5th IEEE International Conference on (pp.
804-807). IEEE.
[15] Bhandari, P., Withana, C., Alsadoon, A., & Elchouemi, A.
(2015, October). Enhanced Apriori Algorithm model in
course
suggestion
system.
InComputing
and
Communication (IEMCON), 2015 International Conference
and Workshop on (pp. 1-5). IEEE.
[16] Mirajkar, A. M., Sankpal, A. P., Koli, P. S., Patil, R. A., &
Pradnyavant, A. R. (2016). Data Mining Based Store Layout
Architecture for Supermarket.
[17] Girotra, M., Nagpal, K., Minocha, S., & Sharma, N. (2013).
Comparative Survey on Association Rule Mining
Algorithms. International
Journal
of
Computer
Applications, 84(10).
[18] Kumbhare, T. A., & Santosh, V. An Overview of
Association Rule Mining Algorithms.
[19] Yldz, B., & Ergen, B. (2010, February). Comparison of
two association rule mining algorithms without candidate
generation. In Proceedings 10th IASTED international
conference on artificial intelligence and applications,
AIA (pp. 450-457).
402 | International Journal of Computer Systems, ISSN-(2394-1065), Vol. 03, Issue 05, May, 2016