Evolutionary approach for mining association rules on dynamic databases

Authors:
P. Deepa Shenoy;K. G. Srinivasa;K. R. Venugopal;L. M. Patnaik
Affiliations:
University Visvesvaraya College of Engineering, Bangalore;University Visvesvaraya College of Engineering, Bangalore;University Visvesvaraya College of Engineering, Bangalore;Microprocessor Application Laboratory, Indian Institute of Science, Bangalore, India
Venue:
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2003

Citing 9
Cited 5

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Genetic algorithms: A Survey

Computer
Beyond intratransaction association analysis: mining multidimensional intertransaction association rules

ACM Transactions on Information Systems (TOIS)
Parallel and Distributed Association Mining: A Survey

IEEE Concurrency
Genetic Search: Analysis Using Fitness Moments

IEEE Transactions on Knowledge and Data Engineering
A Graph-Based Approach for Discovering Various Types of Association Rules

IEEE Transactions on Knowledge and Data Engineering
Mining Optimized Association Rules with Categorical and Numeric Attributes

IEEE Transactions on Knowledge and Data Engineering
Finding Localized Associations in Market Basket Data

IEEE Transactions on Knowledge and Data Engineering
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering

An efficient fuzzy based neuro: genetic algorithm for stock market prediction

International Journal of Hybrid Intelligent Systems
Dynamic Association Rule Mining using Genetic Algorithms

Intelligent Data Analysis
A self-adaptive migration model genetic algorithm for data mining applications

Information Sciences: an International Journal
Evolutionary and immune algorithms applied to association rule mining

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Multi-objective PSO algorithm for mining numerical association rules without a priori discretization

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large volume of transaction data is generated everyday in a number of applications. These dynamic data sets have immense potential for reflecting changes in customer behaviour patterns. One of the strategies of data mining is association rule discovery, which correlates the occurrence of certain attributes in the database leading to the identification of large data itemsets. This paper seeks to generate large itemsets in a dynamic transaction database using the principles of Genetic Algorithms. Intra transactions, Inter transactions and distributed transactions are considered for mining association rules. Further, we analyze the time complexities of single scan DMARG(Dynamic Mining of Association Rules using Genetic Algorithms), with Fast UPdate (FUP) algorithm for intra transactions and E-Apriori for inter transactions. Our study shows that DMARG outperforms both FUP and E-Apriori in terms of execution time and scalability, without compromising the quality or completeness of rules generated. The problem of mining association rules in the distributed environment is explored in DDMARG(Distributed and Dynamic Mining of Association Rules using Genetic Algorithms).