You are on page 1of 8

IPASJ International Journal of Computer Science (IIJCS)

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm


A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

A Survey on Different Association Rule Mining


Algorithms in Data Mining
P.Dhanalakshmi1 , R. Porkodi2
1
M.Phil. Research Scholar, Department of Computer Science, Bharathiar University, Coimbatore-641046.
2
Assistant Professor, Department of Computer Science, Bharathiar University, Coimbatore-641046.

Abstract
Recently, the importance of database mining is growing at an extremely fast pace due to the increasing use of computing for
various applications. One of the most important data mining problems is mining association rules. Association rule mining is a
procedure that is meant to find frequent patterns, correlations, associations or causal structures from data sets found in various
kinds of databases such as relational databases, transactional databases and other forms of data repositories. An association
rule has two parts, an antecedent and a consequent. An antecedent is an item found in the data. A consequent is an item that is
found in combination with the antecedent. In data mining, association rules are useful for analyzing and predicting customer
behavior. Hence, this paper, presents the study of various association rule mining and then discuss about the previous
researches which are associated with the association rule mining. Moreover, this paper gives the overview of the various
association rule mining algorithms, including Apriori, Eclat, FP-growth algorithms and its comparisons. The main objective of
this research is to study about different association rule mining algorithms. Finally, comparisons are made in association rule
mining in terms of merits, demerits, outcomes and data sets.
Keywords: Data mining, Association rules and Databases.

1. INTRODUCTION
Data mining, as a discipline, is a consortium of techniques ranging from statistics, computer science, operations
research and artificial intelligence, for efficient and automated discovery of previously unknown, valid, novel,
actionable and understandable knowledge in large databases. The main tasks in data mining are classification,
clustering, regression and association rule mining and outlier detection. Association rule mining finds interesting
associations or correlation relationships among a large set of data items. With massive amounts of data continuously
being collected and stored in databases, many industries are getting interested in mining association rules from their
databases.
Data mining techniques are to explore the interesting and useful information hidden in databases, where the meaning
of interest and usefulness depends on the problem formulation and the application domain. Association rule mining
plays an important role in many decision systems and association rules help to determine the relationships among
objects in the database.
Association rules are created by analyzing data for frequent patterns and using the criteria support and confidence to
identify the most important relationships. Support is an indication of how frequently the items appear in the database.
Confidence indicates the number of times the statements have been found to be true. Moreover, association rule mining
is the data mining task employed to solve asignificantissue in marketing parlance viz., market basket analysis. This
process analyzes customers buying habits by finding associations between the different items that customers place in
their shopping baskets. The discovery of such associations can help retailers develop marketing strategies by gaining
insight into which items are frequently purchased together by their customers. Association rule mining extracts implicit
relationships between items from a set of transactions where each transaction is a set of one or
more co-occurring items. Association rule mining algorithms such as Apriori[1], Eclat [2] and FP-growth [3].
Association rules are a well-established technique for mining information from structured databases. They provide
support for the identification of novel, potentially useful, and comprehensive knowledge in the form of implications X
Y, which represent the joint co-occurrence of X and Y in the database. The data used for data mining is usually
assumed to be the primary data captured by some application, cleaned and preprocessed according to the necessities of
the mining algorithm. However, in other applications, primary data is only available for a short time. That is the case
of stream data which is not usually stored, but processed in real time and then deleted after storing the results. Beside

Volume 5, Issue 10, October 2017 Page 126


IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

this, primary data might not be available in several scenarios, or the owners may not be authorized to share it. For
instance, this is the case of law enforcing agencies facing security threats and other institutions that cannot disclose
personal data. But, these organizations may be able to publish summarized or extracted knowledge. Beside this, the
well known overwhelming number of association rules extracted by traditional algorithms prevents their inspection in a
feasible time. Hence, the main contribution of this paper is to analyse the different association rules in data mining.
The rest of the paper is organized as follows: Section 2 describes the literature review. Section 3 describes the various
association rule mining algorithms. Section 4 describes comparison of association rule mining. Section 5 concludes the
research.

2. LITERATURE SURVEY
A knowledge discovery scheme [4] was proposed which utilizes a combination of statistical methods and machine
learning to identify interesting regions of information and diverse association rules in large multidimensional data
cubes. In addition, introduced a measure using information gain to recognize and rank the most informative
dimensions between nominal variables that should be retained for schema design. Moreover, through the application of
Principal Components Analysis and the use of information gain based measure extract informative data cubes at
different levels of data abstraction and explored the effect of abstraction level on information content. However,
performance and scalability was low of this approach.
A binary particle swarm optimization (BPSO) based association rule miner [5] was developed. BPSO based association
rule miner creates bv the association rules from the transactional database through formulating a combinatorial global
optimization issue, without specifying the minimum support and minimum confidence unlike the apriori algorithm. In
this algorithm, creates the best M rules from the input database, where M is an input number. Then the quality of the
rule was measured through a fitness function described as the product of confidence and support. This algorithm was
tested on a real-life bank dataset taken from a commercial bank in India. Then its performance was compared with that
of the apriori algorithm and FP-growth algorithm. However, the BPSO algorithm was run as many times as the number
of rules was required by the user.
An Apriori-like approach (HCARM) [6] was presented for mining interesting rules from transaction databases.First,
highly coherent association rules were developed to help decision-makers make marketing methods. Next, to decrease
the time required to generate candidate coherent itemsets, the corresponding lower and upper bounds of supports of
subitemsets in the consequent part of an itemset are described for removing itemsets that cannot become highly
coherent itemsets. But, this approach does not support more complex problems.
A data mining technique, Multi-ontology data mining at All Levels (MOAL) [7] was presented that used the structure
and relationships of the GO to mine multi-ontology multi-level association rules. In addition, introduced two
interestingness measures: Multi-ontology Confidence (MO Confidence) and Multi-ontology Support (MO Support)
customized to calculate multi-ontology multi-level association rules. Moreover, described a variety of post-processing
techniques for pruning uninteresting rules. In this approach, used publicly available GO annotation data to demonstrate
these techniques with respect to two applications (1) the discovery of co-annotation suggestions and (2) the discovery of
new cross ontology relationships. But, complications may occur when ontologies developed by different groups are
used.
A compressed representation [8] was proposed for association rules having minimal antecedent and maximal
consequent. This representation was generated with the help of high utility closed itemsets (HUCI) and their
generators. In addition, introduced the algorithms to generate the utility based non-redundant association rules and
techniques for reconstructing all association rules. Moreover, defined the algorithms that generate high utility itemsets
(HUI) and high utility closed itemsets with their generators. These algorithms were implemented using both synthetic
and real datasets. However, in this approach, utility-based interestingness measures and subjective interesting measures
are not incorporated.
A Genetic Algorithm (GA)-based scheme [9] was presented which integrates the idea hierarchy of construction defects
to determine multi-level patterns of defects from the database of defects in the Chinese construction industry during
2000 to 2010. Initially, the domain knowledge of construction defect was integrated into an idea hierarchy to adjust
mining items at different levels along with the data sparseness and the interestingness of a rule. Additionally, this
scheme was introduced to create interesting association rules without specified threshold of minimum confidence,

Volume 5, Issue 10, October 2017 Page 127


IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

taking benefit of the searching capability of GA. Lastly, the redundant rules in the mining outcomes were pruned
through post-processing technique.But, the data model of defects was not refined of this technique.
An adaptive relational association rule scheme, using the discovery of interesting relational association rules [10] was
introduced. This scheme, known as Adaptive Relational Association Rule Mining (ARARM) adapts the set of rules
which was recognized through mining the data before the feature set changed, preserving the completeness. Moreover,
plan to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended
object set.However, the evaluation of the ARARM scheme does not support different data sets and real life issues.
Adaptive Particle Swarm optimization (PSO) based Association Rule Mining Technique [11] was proposed for
Software Defect Classification using Artificial Neural Network (ANN).The proposed technique classifies numerous
defects via using association rule mining dependent issue classification technique that was applied to gather the actual
defects by identification. In this examination, Adaptive Particle Swarm (APSO) optimization algorithm was utilized.
This could determine the best assistance and confidence value to have the best policies. At last, ANN was used to
categorize the actual defects determined. But, large complexity of the network structure of the ANN method.
A novel approach Fuzzy Frequent Pattern Ubiquitous Streams (FFP_USTREAM) and studied the issue of mining,
fuzzy association rules from ubiquitous data streams [12] was developed. In this approach, incorporates fuzzy concepts
with ubiquitous data streams, using the sliding window technique, to mine fuzzy association rules. Additionally, the
efficiency and the complexity of this approach were explained. However, this method does not use variable window size
and pane size. So it is not worthwhile.
A novel technique [13] was introduced to mining relevant class association rules (CARs) which considers constraints
on the rule consequent. In addition, a tree structure for saving frequent itemsets from the dataset was designed. After
that, various theorems for pruning tree nodes which cannot create rules satisfying the class constraints were offered and
demonstrated. At last, an efficient algorithm for mining constrained CARs was presented. But, a weakness of
Constraint-CAR-Miner was that when the number of constrained rules in a given class dominates the total constrained
rules; its overall performance was slower than the naive approach.
A Partition Enhanced Mining Algorithm (PEMA) [14] was presented. In this approach, the Association Rule Mining
Coordinating Agent receives a request and decides the appropriate data sites, dividing approach and mining agents to
employ. The mining procedure was separated into two stages. In the initial stage, the data agents horizontally segment
the databases with small average transaction length into relatively smaller partitions using the number of available sites
and the obtainable memory. Further, databases with relatively large average transaction length were vertically divided.
Following this, Mobile Agent-Based Association Rule Mining-Agents that were the mining agents, carry out the
discovery of the local frequent itemsets. In the second stage, the local frequent itemsets were incrementally incorporated
through the from one data site to another to get the global frequent itemsets. This technique decreased the response
time and communication cost in the scheme.However, security problems were occur in outsourcing of DARM tasks in
the cloud computing environment.
The concept of association rule mining [15] was proposed. The proposed technique was exposed assisting to promote
the physical exercise as regular human activity. Particularly, same to the prototypical instance of association rule
mining, market basket analysis, the proposed novel technique considers two events sleep (regular) and exercise
(sporadic) as the two items of the frequent set; and associating the former, exercise event, with latter, the daily
occurring activity sleep at night, helps strengthening the frequency of the exercise patterns.The use of large dataset was
optional but, this miniscule sample size, from some critics point of view, could be considered as one of the limitations
of this technique.
A heuristic technique to extract mostly associated patterns (MASPs) [16] was introduced. The proposed technique used
a maximally-association constraint to produce patterns without searching the complete lattice of item combinations.
The proposed technique does not need a pruning procedure. Moreover, this technique needs less computational
resources in terms of time and memory requirements as creating a long sequence of patterns that have the highest co-
occurrence. In addition, k-item patterns could be obtained recognition to the sub-lattice property of the MASPs.
Furthermore, the algorithm generates a tree of the detected patterns; this tree can assist decision makers for visual
analysis of data. This technique has a potential to be used in big data analytics. The current implementation needs the
data to reside in the memory; this limits the amount of the data to be processed. This issue can be addressed by utilizing
disk memory trading the computation time.

Volume 5, Issue 10, October 2017 Page 128


IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

3. ASSOCIATION RULE MINING ALGORITHMS


Association rules are created by analyzing data for frequent patterns and using the criteria support and confidence to
identify the most important relationships. Support is an indication of how frequently the items appear in the database.
Confidence indicates the number of times the statements have been found to be true. In data mining, association rules
are useful for analyzing and predicting customer behavior and play an important part in shopping basket data analysis,
product clustering, catalog design and store layout.
Association rule learning is a rule-based machine learning method for discovering interesting relations between
variables in large databases. It is intended to identify strong rules discovered in databases using some measures of
interestingness. Association rule mining such as Multi-relation association rules, context based association rules,
Quantitative association rules, subspace clustering and so on. This part of the paper describes the three association rule
mining algorithms namely Apriori algorithm, Eclat algorithm and FP-growth algorithm along with their merits and
demerits.
3.1 Apriori Algorithm

3.1.1 Association rule mining process


Association rules are usually required to satisfy a user-specified minimum support and a user-specified minimum
confidence at the same time. Association rule generation is usually split up into two separate steps:
A minimum support threshold is applied to find all frequent itemsets in a database.
A minimum confidence constraint is applied to these frequent itemsets in order to form rules.
While the second step is straightforward, the first step needs more attention.
Finding all frequent itemsets in a database is difficult since it involves searching all possible itemsets. The set of
possible itemsets is the power set over I and has size 2n-1. Although the size of the power-set grows exponentially in the
number of items n inI, efficient search is possible using the downward-closure property of supportwhich guarantees that
for a frequent itemset, all its subsets are also frequent and thus no infrequent itemset can be a subset of a frequent
itemset. Exploiting this property, efficient algorithms (Apriori and Eclat) can find all frequent itemsets.
Association rule mining, given a set of itemsets (for instance, sets of retail transactions, each listing individual items
purchased), the algorithm attempts to find subsets which are common to at least a minimum number C of the itemsets.
Apriori uses a "bottom up" approach, where frequent subsets are extended one item at a time and groups of candidates
are tested against the data. The algorithm terminates when no further successful extensions are found.
Apriori uses breadth-first search and a tree structure to count candidate item sets efficiently. It generates candidate item
sets of length k from item sets of length k 1. Then it prunes the candidates which have an infrequent sub pattern.
According to the downward closure lemma, the candidate set contains all frequent k-length item sets. After that, it
scans the transaction database to determine frequent item sets among the candidates. Apriori, while historically
significant, suffers from a number of inefficiencies or trade-offs, which have spawned other algorithms. Candidate
generation generates large numbers of subsets. Bottom-up subset explorationfinds any maximal subset S only after all 2
|S|
1 of its proper subsets.
3.2 Eclat Algorithm
Eclat algorithm is based on the breadth-first search strategy, which adopts the technologies of vertical data format,
lattice theory, equivalence classes, intersection and so on. The main steps of Eclat are listed as follows: scan the
database to get all frequent 1-itemsets, generate candidate 2-itemsets from frequent 1-itemsets, then get all frequent 2-
itemsets by clipping non-frequent candidate itemsets; generate candidate 3-itemsets from frequent 2-itemsets and then
get all frequent 3-itemsets by clipping non-frequent candidate itemsets; repeat the above steps, until no candidate
itemset can be generated.

There are two different data formats: horizontal data format and vertical data format. The data format of Eclat is
vertical data format. Both data formats are the representations of database in memory. Horizontal data format, a TID-
itemset format, can also be expressed as TID: itemset, in which TID is the unique identifier of a transaction in
database, itemset is the set of items included in the transaction. Vertical data format, an Item-TID_set format, can
also be expressed as Item: TID_set, in which Item is an item in database, TID_set is the set of transactions
including the items.

Volume 5, Issue 10, October 2017 Page 129


IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

Same as Apriori, Eclat algorithm also adopts the join operation () to generate candidate (K+1)-itemset by taking the
union of two k-itemset. The condition of two k-itemset can be joined is that the front k-1 items of the two k-itemset
must be the same. For example, there are two 3-itemset: and , the first and
second items of are the same, so can be joined to generate a 4-itemset:
. By using the concept of equivalence classes, Eclat divides the search space
into multiple nonoverlapping sub spaces. The itemsets which have same prefix can be classified into a same class, and
the generation of candidate itemsets can be only operated in a same class. The technology of equivalence classes can
obviously improve the efficiency of generating candidate itemset and can decrease the occupation of memory.
3.3 Fp-growth Algorithm
The FP-Growth Algorithm is an efficient and scalable method for mining the complete set of frequent patterns by
pattern fragment growth, using an extended prefix-tree structure for storing compressed and crucial information about
frequent patterns named frequent-pattern tree (FP-tree). This Algorithm is an alternative way to find frequent itemsets
without using candidate generations, thus improving performance. For so much it uses a divide-and-conquer technique.
The core of this method is the usage of a special data structure named frequent-pattern tree (FP-tree), which retains the
itemset association information.
This algorithm works as follows: first it compresses the input database creating an FP-tree instance to represent
frequent items. After this first step it divides the compressed database into a set of conditional databases, each one
associated with one frequent pattern. Finally, each such database is mined separately. Using this strategy, the FP-
Growth reduces the search costs looking for short patterns recursively and then concatenating them in the long frequent
patterns, offering good selectivity.In large databases, its not possible to hold the FP-tree in the main memory. A
strategy to cope with this problem is to firstly partition the database into a set of smaller databases and then construct
an FP-tree from each of these smaller databases.

4. COMPARISON OF DIFFERENT ASSOCIATION RULE MINING


The extensive survey has been conducted in association rule mining algorithms in data mining for different datasets.
The outcome of the survey produces the comparison of various association rule mining algorithms based on
experimental dataset used, outcome of their research and demerits are listed in table1.

Table 1: Comparison of Association rule mining


Author Name Association rules Dataset Outcome Merits Demerits
S. No
1 Kk, D, FPQONT based DBpedia Accuracy= Significant Low precision rate
2015 [17]. categorizer 99.09% coverage

2 Najafabadi, M. Collaborative Million song Precision=86% High accuracy Low quality


K., Mahrin, M. filtering, Recall=6%
N. R., Chuprat, association rule, a=69%
S., &Sarkan, H. K-Means
M, 2017 [18]. clustering, hybrid
representation,
and probabilistic
learning

3 Dhanalaxmi, Association rules, Promise datasets Accuracy= 100% Reliability and Large complexity
B., Naidu, G. Adaptive Particle Precision= 99.5% efficiency of the network
A., Swarm structure of the
&Anuradha, K, Optimization and ANN method.
2015 [19] Artificial Neural
Network

Volume 5, Issue 10, October 2017 Page 130


IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

4 Rana, Z. A., Association rules CM1, PC3, KC3, Recall= 75% Highly effective Budget constraints
Mian, M. A., and preprocessing MC1, and AR4 FPrate= 22% are too severe
&Shamail, S, approach
2015 [20].
5 Kargarfard, F., Classification and 26 datasets Accuracy=99.6% Speed and high Low
Sami, A., association rule Sensitivity =100% accuracy computational and
&Ebrahimie, E, mining algorithm Specificity=92.4% financial cost.
2015 [21] Precision=99.58%

6 Paul, R., Characteristic ESDN Accuracy47.50% More accurate It does not


Groza, T., Feature Mining Precision=26.73% result perform multi
Hunter, J., algorithm Recall=24.68% levelcharacteristic
&Zankl, A, s feature algorithm
2014 [22],
7 Tyagi, S., Multi-Objective MovieLens (HD100 and given High Less reliability
&Bharadwaj, PSO for Direct 20) computational
K. K, 2013 Association Rule Accuracy=57.11% efficiency
[23]. mining Precision=58.15%
Recall=80.58%
F1-
meausre=68.52%

8 Kardan, A. A., Collaborative MetaFilter and Accuracy=12.49% High quality Less accuracy
&Ebrahimi, M, Filtering, content Yahoo Answers Precision=11.30%
2013 [24]. based filtering Recall=85%
and hybrid F1-meausre=19%
filtering using
association rules
mining technique

9 Czibula, G., classification NASA (CM1, Accuracy=87.16% Highly Effective It was only
Marian, Z., model based on KC1, KC3 PC1 Precision=50% provide less useful
&Czibula, I. G, relational and so on) information
2014 [25]. association
rules mining

10 Sebastian, Y., Knowledge CHD_DB Precision= 69% Significant rules Increases mining
& Then, P. H, Extraction via Recall=47% discovered time and usage of
2011 [26]. Logical computing
Association resources.
Mining,
Semantic-based
attribute
discretization and
mapping and FP-
Growth algorithm

5. CONCLUSION
In this paper, an extensive survey have been conducted using various association rule mining algorithms, including
Apriori, Eclat and FP-growth algorithm and the overall performance of these algorithms have been studied. Association
rules are generated by evaluating frequent data patterns under the support and confidence criteria to discover the most
important relationships. From the above background study, it is observed that the most using evaluation parameters for
association rule mining algorithms are precision, recall and accuracy. According to this survey, while comparing with
characteristic Feature Mining algorithm and classification model based on relational association rules mining

Volume 5, Issue 10, October 2017 Page 131


IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

algorithm, precision parameter discovery of ARM algorithm gives better result. In the future, we plan to explore the
cross ontology data mining and speed up mining.

References
[1] R. Agrawal and R. Srikant, (1994, September). Fast algorithms for mining association rules. In Proc. 20th int.
conf. very large data bases, VLDB (Vol. 1215, pp. 487-499).
[2] M. J. Zaki (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data
Engineering, 12(3), 372-390.
[3] J. Han, J. Pei, Y. Yin, and R. Mao, (2004). Mining frequent patterns without candidate generation: A frequent-
pattern tree approach. Data mining and knowledge discovery, 8(1), 53-87.
[4] M. Usman, R. Pears and A. C. M. Fong, (2013). Discovering diverse association rules from multidimensional
schema. Expert systems with applications, 40(15), 5975-5996.
[5] K. N. V. D. Sarath and V. Ravi, (2013). Association rule mining using binary particle swarm
optimization. Engineering Applications of Artificial Intelligence, 26(8), 1832-1840.
[6] C. H. Chen, G. C. Lan, T. P. Hong and Y. K. Lin, (2013). Mining high coherent association rules with
consideration of support measure. Expert Systems with Applications, 40(16), 6531-6537.
[7] P. Manda, F. McCarthy and S. M. Bridges, (2013). Interestingness measures and strategies for mining multi-
ontology multi-level association rules from gene ontology annotations for the discovery of new GO
relationships. Journal of biomedical informatics, 46(5), 849-856.
[8] J. Sahoo, A. K. Das and A. Goswami, (2015). An efficient approach for mining association rules from high
utility itemsets. Expert Systems with Applications, 42(13), 5754-5778.
[9] Y. Cheng and Q. Li, (2015). GAbased multi-level association rule mining approach for defect analysis in the
construction industry. Automation in Construction, 51, 78-91.
[10] G. Czibula, I. G. Czibula, A. M. Srbu and I. G. Mircea, (2015). A novel approach to adaptive relational
association rule mining. Applied Soft Computing, 36, 519-533.
[11] G. Agapito, M. Cannataro, P.H. Guzzi and M. Milano, (2015). Using GO-WAR for mining cross-ontology
weighted association rules. Computer methods and programs in biomedicine, 120(2), 113-122.
[12] A. Moustafa, B. Abuelnasr and M. S. Abougabal, (2015). Efficient mining fuzzy association rules from
ubiquitous data streams. Alexandria Engineering Journal, 54(2), 163-174.
[13] D. Nguyen, L. T. Nguyen, B. Vo and T. P. Hong, (2015). A novel method for constrained class association rule
mining. Information Sciences, 320, 107-125.
[14] A. O. Ogunde, O. Folorunso and A. S. Sodiya, (2015). A partition enhanced mining algorithm for distributed
association rule mining systems. Egyptian Informatics Journal, 16(3), 297-307.
[15] S. Sharma, U. S. Tim, M. Payton, H. Cohly, S. Gadia, J. Wong, and S. Karakala, (2015). Contextual motivation
in physical activity by means of association rule mining. Egyptian Informatics Journal, 16(3), 243-251.
[16] . M. Soysal, (2015). Association rule mining with mostly associated sequential patterns. Expert Systems with
applications, 42(5), 2582-2592.
[17] Kk, D. (2015). A high-level electrical energy ontology with weighted attributes. Advanced Engineering
Informatics, 29(3), 513-522.
[18] M. K. Najafabadi, M. N. R. Mahrin, S. Chuprat and H. M. Sarkan, (2017). Improving the accuracy of
collaborative filtering recommendations using clustering and association rules mining on implicit
data. Computers in Human Behavior, 67, 113-128.
[19] B. Dhanalaxmi, G. A. Naidu and K. Anuradha, (2015). Adaptive PSO Based Association Rule Mining
Technique for Software Defect Classification Using ANN. Procedia Computer Science, 46, 432-442.
[20] Z. A. Rana, M. A. Mian and S. Shamail, (2015). Improving Recall of software defect prediction models using
association mining. Knowledge-Based Systems, 90, 1-13.
[21] F. Kargarfard, A. Sami and E. Ebrahimie, (2015). Knowledge discovery and sequence-based prediction of
pandemic influenza using an integrated classification and association rule mining (CBA) algorithm. Journal of
biomedical informatics, 57, 181-188.
[22] R. Paul, T. Groza, J. Hunter and A. Zankl, (2014). Inferring characteristic phenotypes via class association rule
mining in the bone dysplasia domain.Journal of biomedical informatics, 48, 73-83.
[23] S. Tyagi and K. K. Bharadwaj, (2013). Enhancing collaborative filtering recommendations by utilizing multi-
objective particle swarm optimization embedded association rule mining. Swarm and Evolutionary
Computation, 13, 1-12.

Volume 5, Issue 10, October 2017 Page 132


IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm
A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992

[24] A. A. Kardan and M. Ebrahimi, (2013). A novel approach to hybrid recommendation systems based on
association rules mining for content recommendation in asynchronous discussion groups. Information
Sciences,219, 93-110.
[25] G. Czibula, Z. Marian and I. G. Czibula, (2014). Software defect prediction using relational association rule
mining. Information Sciences, 264, 260-278.
[26] Y. Sebastian and P. H. Then, (2011). Domain-driven KDD for mining functionally novel rules and linking
disjoint medical hypotheses. Knowledge-Based Systems, 24(5), 609-620.

Volume 5, Issue 10, October 2017 Page 133

You might also like