Swarm of Honey Bees for Association Rule Mining Using CUDA

Swarm of Honey Bees for Association Rule Mining Using CUDA

Alankar Shantaram Shelar, Raj Kulkarni
Copyright: © 2022 |Pages: 27
DOI: 10.4018/IJSI.297996
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Association Rule mining (ARM) is well studied and famous optimization problem which finds useful rules from given transactional databases. Many algorithms already proposed in literature which shows their efficiency when dealing with different sizes of datasets. Unfortunately, their efficiency is not enough for handling large scale datasets. In this case, Bees swarm optimization algorithm for association rule mining is more efficient. These kinds of problems need more powerful processors and are time expensive. For such issues solution can be provided by graphics processing units (GPUs) and are massively multithreaded processors. In this case GPUs can be used to increase speed of the computation. Bees swarm optimization algorithm for association rule mining can be designed using GPUs in multithreaded environment which will efficient for given datasets.
Article Preview
Top

1.1 Introduction

Association Rule Mining (ARM) is one of the most useful and well known technique of data mining Han J. (2011). It is used to extracts frequent patterns, associations, correlations, or causal structures among sets of items from given datasets. Datasets can be considered as transactional databases, relational databases and other information repositories. Formally, association rule mining problem is explained as follows: Let,

T be m number of transactions or set of records like {t1, t2, t3,…………, tm} from given datasets.

I be a set of n different items or attributes {i1, i2, i3, ……..…, in},

An association rule is an implication of the form IJSI.297996.m01 where IJSI.297996.m02, IJSI.297996.m03, and IJSI.297996.m04. The itemset X is called antecedent part (left side) while the itemset Y is called consequent part (right side) and the rule means X implies Y.

Association Rule Mining is related to finding a set of rules considering a large percentage of data and it tends to generate a useful number of rules. However, since the number of transactions are increasingly more, the user no longer looks for all the possible rules but user looks to determine only a subset of important rules. To measure usefulness of association rules, mainly two basic parameters are used, one is namely support of a rule and second is confidence of rule. The support of an itemset IJSI.297996.m05 is the number of records containing I¢. The support of a rule IJSI.297996.m06 is the support of IJSI.297996.m07 and the confidence of a rule is IJSI.297996.m08. An association rule IJSI.297996.m09with a confidence of 70% means that 70% of the transactions that contain X also contain Y together. So, the association rule mining is to find important rules which are having support ≥ MinSup and confidence ≥ MinConf Agrawal (1996). Here, MinSup and MinConf are two threshold predefined by users.

However, Association Rule Mining is difficult task when it applies on large scale datasets. The classical methods already developed to solve this problem, like Apriori, Agarwal (1993), FPgrowth, Han J (2000) algorithms, but it requires more CPU time when handling such data. To deal with this problem in reasonable time many higher level algorithms and procedures are applied to ARM. Some methods are based on evolutionary algorithms like Genetic Algorithm and some are based on swarm intelligence.

Complete Article List

Search this Journal:
Reset
Volume 12: 1 Issue (2024)
Volume 11: 1 Issue (2023)
Volume 10: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 9: 4 Issues (2021)
Volume 8: 4 Issues (2020)
Volume 7: 4 Issues (2019)
Volume 6: 4 Issues (2018)
Volume 5: 4 Issues (2017)
Volume 4: 4 Issues (2016)
Volume 3: 4 Issues (2015)
Volume 2: 4 Issues (2014)
Volume 1: 4 Issues (2013)
View Complete Journal Contents Listing