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 chapter 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 technique 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 the algorithm DMARG outperforms both FUP and E-Apriori in terms of execution time and scalability, without compromising the quality or completeness of rules generated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pujari, A.: Data Mining Techniques. University Press (2000)
Shenoy, P.D.: Evolutionary Approach for Mining Association Rules on Dynamic Databases. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS, vol. 2637, pp. 325–336. Springer, Heidelberg (2003)
Srinivas, M., Patnaik, L.M.: Genetic Algorithms: A Survey. IEEE Computers 27(6), 17–26 (1994)
Cheung, D.W., Han, J., Vincent, T., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Proc. of Intl. Conf. on Data Engineering, pp. 106–114 (Feburary 1996)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of Intl. Conf. on Very Large Data Bases, Santiago, pp. 478–499 (September 1994)
Park, J.S., Chen, M.S., Yu, P.: An Effective Hash based Method for Mining Association Rules. In: Proc. of ACM-SIGMOD Intl. Conf. on Management of Data, pp. 175–186 (May 1995)
David, W., Cheung, L., Lee, S.D., Kao, B.: A General Incremental Technique for Maintaining Discovered Association Rules. In: Proc. of 5th Intl. Conf. on Database Systems for Advanced Applications, Melbourne (1997)
Ganthi, V., Gehrke, J., Ramakrishnan, R.: DEMON: Mining and Monitoring Evolving Data. IEEE Trans. on Knowledge and Data Engineering 13(1), 50–62 (2001)
Thomas, S., Chakravarthy, S.: Incremental Mining of Constrained Associations. In: Prasanna, V.K., Vajapeyam, S., Valero, M. (eds.) HiPC 2000. LNCS, vol. 1970, pp. 547–558. Springer, Heidelberg (2000)
Thomas, S., Bodagal, S., Alsabti, K., Ranka, S.: An Efficient Algorirhm for the Incremental Updation of Association Rules in Large Databases. In: Proc. of KDD 1997, pp. 263–266 (1997)
Fildman, R., Aumann, Y., Amir, A., Manila, H.: Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. In: Proc. of SIGMOD Workshop on Research Issues in DMKD, pp. 59–66 (1997)
Harishta, J.: Technical Report on Data Mining, Dept. of CSA, IISc (1997)
Lu, H., Feng, L., Han, J.: Beyond Intra-Transaction Association Analysis: Mining Multi-Dimensional Inter-Transaction Association Rules. ACM Transactions on Information Systems 18(4), 423–454 (2000)
Anthony, K., Tung, H., Lu, H., Han, J., Feng, L.: Breaking the Barrier of Transactions: Mining Inter-Transaction Association Rules. In: Proc. of Intl. Conf. on Knowledge Discovery and Data Mining, pp. 297–300 (August 1999)
Agrawal, R., Shafer, J.: Parallel Mining of Association Rules. IEEE Tran. on Knowlegde and Data Engineering 8(6), 962–969 (1996)
Cheung, D.W., Han, J., Ng, V.T., Fu, A.W., Fu, Y.: A Fast Distributed Algorithm for Mining Association Rules. In: Proc. of IEEE Intl. Conf. on Parallel and Distributed Information Systems, pp. 31–42 (December 1996)
Han, E.-H., Karypis, G., Kumar, V.: Scalable Parallel Data Mining for Association Rules. In: Proc. of ACM-SIGMOD Intl. Conf. on Management of Data, pp. 277–288 (1997)
Shintani, T., Kitsuregawa, M.: Parallel Mining Algorithms for Generalized Association Rules with Classification Hierarchy. In: Proc. of ACM SIGMOD, Intl. Conf. on Management of Data, pp. 25–36 (1998)
Synthetic Data Generator, http://www.almaden.ibm.com/cs/quest/syndata.html
Real Data Set from KDD CUP, http://www.ecn.purdue.edu/KDDCUP/data/BMS-WebView-1.dat.gz
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Venugopal, K.R., Srinivasa, K.G., Patnaik, L.M. (2009). Dynamic Association Rule Mining Using Genetic Algorithms. In: Soft Computing for Data Mining Applications. Studies in Computational Intelligence, vol 190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00193-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-00193-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00192-5
Online ISBN: 978-3-642-00193-2
eBook Packages: EngineeringEngineering (R0)