Evolutionary approach for mining association rules on dynamic databases. (English) Zbl 1032.68631

Shenoy, P. Deepa; Srinivasa, K. G.; Venugopal, K. R.; Patnaik, L. M.

Whang, Kyu-Young (ed.) et al., Advances in knowledge discovery and data mining. 7th Pacific-Asia conference, PAKDD 2003, Seoul, Korea, April 30 - May 2, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2637, 325-336 (2003).

Summary: 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).
For the entire collection see [Zbl 1018.00016].

MSC:

68P15	Database theory
68P20	Information storage and retrieval of data
68T05	Learning and adaptive systems in artificial intelligence