OPTIMIZED ASSOCIATION RULE MINING USING GENETIC ALGORITHM

Anandhavalli M.1*, Suraj Kumar Sudhanshu2*, Ayush Kumar3, Ghose M.K.4*
1Department of Computer Science Engineering, Sikkim Manipal Institute of Technology, East Sikkim, India
2Department of Computer Science Engineering, Sikkim Manipal Institute of Technology, East Sikkim, India
3Department of Computer Science Engineering, Sikkim Manipal Institute of Technology, East Sikkim, India
4Department of Computer Science Engineering, Sikkim Manipal Institute of Technology, East Sikkim, India
* Corresponding Author : mkghose2000@yahoo.com

Received : -     Accepted : -     Published : 21-12-2009
Volume : 1     Issue : 2       Pages : 1 - 4
Adv Inform Min 1.2 (2009):1-4

Keywords : Genetic Algorithm (GA), Association Rules, Support, Confidence, Data Mining
Conflict of Interest : None declared

Cite - MLA : Anandhavalli M., et al "OPTIMIZED ASSOCIATION RULE MINING USING GENETIC ALGORITHM." Advances in Information Mining 1.2 (2009):1-4.

Cite - APA : Anandhavalli M., Suraj Kumar Sudhanshu, Ayush Kumar , Ghose M.K. (2009). OPTIMIZED ASSOCIATION RULE MINING USING GENETIC ALGORITHM. Advances in Information Mining, 1 (2), 1-4.

Cite - Chicago : Anandhavalli M., Suraj Kumar Sudhanshu, Ayush Kumar , and Ghose M.K. "OPTIMIZED ASSOCIATION RULE MINING USING GENETIC ALGORITHM." Advances in Information Mining 1, no. 2 (2009):1-4.

Copyright : © 2009, Anandhavalli M., et al, Published by Bioinfo Publications. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution and reproduction in any medium, provided the original author and source are credited.

Abstract

In general the rule generated by association rule mining algorithms like priori, partition, pincer-search, incremental, border algorithm etc, does not consider negation occurrence of the attribute in them and also these rules have only one attribute in the consequent part. By using Genetic Algorithm (GAs) the system can predict the rules which contain negative attributes in the generated rules along with more than one attribute in consequent part. The major advantage of using GAs in the discovery of prediction rules is that they perform global search and its complexity is less compared to other algorithms as the genetic algorithm is based on the greedy approach. The main aim of this paper is to find all the possible optimized rules from given data set using genetic algorithm.

References

[1] Agrawal R., Imielinksi T. and Swami A. (1993) Database mining: a performance perspective, IEEE Transactions on Knowledge and Data Engineering 5 (6), 914–925  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[2] Chen M.S., Han J. and Yu P.S. (1996) Data Mining: An Overview from a Database Perspective, IEEE Trans. Knowledge and Data Eng., 866-883  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[3] Agrawal R. and Srikant R. (1994) Fast algorithms for mining association rules. In VLDB'94, Santiago, Chile, 487-499.  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[4] Agrawal R., Imielinski T. and Swami A. (1993) Mining Association rules between sets of items in large databases, In the Proc. of the ACM SIGMOD Int’l Conf. on Management of Data (ACM SIGMOD ‘93), Washington, USA, 207-216  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[5] Pei M., Goodman E.D., Punch F. (2000) Feature Extraction using genetic algorithm, Case Center for Computer-Aided Engineering and Manufacturing W. Department of. Computer Science  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[6] Stuart J. Russell, Peter Norvig (2008) Artificial Intelligence: A Modern Approach  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus