By Topic

Association rule mining algorithms and Genetic Algorithm: A comparative study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Soumadip Ghosh ; Dept. of Comput. Sci. & Eng., Acad. of Technol., Hooghly, India ; Susanta Biswas ; Debasree Sarkar ; P. P. Sarkar

Generally frequent itemsets are extracted from large databases by applying association rule mining (ARM) algorithms like Apriori, Partition, Pincer-Search, Incremental, and Border algorithm etc. Genetic Algorithm (GA) can also be applied to discover the frequent patterns from databases. The main advantage of using GA in the discovery of frequent patterns or itemsets is that they can perform global search and its time complexity is lesser compared to other Apriori-based algorithms as because it is based on the greedy approach. But the FP-tree algorithm is considered to be the best among the ARM algorithms, because its candidate sets generation procedure is completely different from Apriori-based algorithms. The major aim of this paper is to present a comparative study among ARM-based and GA-based approaches to data mining.

Published in:

Emerging Applications of Information Technology (EAIT), 2012 Third International Conference on

Date of Conference:

Nov. 30 2012-Dec. 1 2012