Abstract
There is a common belief that the association rule mining has a major stake in data mining research domain. Numerous algorithms are proposed for discovering frequent itemsets. This is the key process in association rule mining. This proposed paper introduces two concepts. First leads to analyze the ability to explore the demographic parameters of the underlying entities and their inter relations using the traditional graph theory approach(vertices and edges). Second is the improved algorithm based on graph and clustering based mining association rules. This improved algorithm is named Graph and Clustering Based Association Rule Mining (GCBARM). The GCBARM algorithm scans the database of transaction only once to generate a cluster table and then clusters the transactions into cluster according to their length. The GCBARM algorithm is used to find frequent itemsets and will be extracted directly by scanning the cluster table. This method reduces memory requirement and time to retrieve the datasets and hence it is scalable for any large size of the database.
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
Klosgen, W., Zytkow, J.M.: Hand Book of Data Mining and Knowledge Discovery. Oxford University Press (2002)
Kamber, M., Han, J.: Data Mining Concepts and Techniques. Morgan Kauffman Publishers, San Francisco (2001)
Imielinski, T., Agrawal, R., Swami, A.N.: Data Mining a Performance Perspective. IEEE Transactions on Knowledge and Data Engineering 5, 914–925 (1993)
Agrawal., R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the Twentieth International Conference on Very Large Databases, Santiago, Chile, pp. 487–499 (1994)
Han, J., Fu, Y.: Mining Multiple Level Association Rules in Large Databases. In: Proceeding of 1995 Int’l Conf. on Very Large Data Bases (VLDB 1995), Zurich, Switzerland, pp. 420–431 (1995)
Agrawal, R., Imilienski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Int’l Conf. on Mgt of Data, Washington, DC, pp. 207–216 (1993)
Han, J., Pei, J., Yin, Y.: Mining frequent Patterns without Candidate Generation. In: ACM-SIGMOD, Dallas (2000)
Berzal, F., Cubero, J.C., Marin, N., Serrano, J.M.: TBAR: An Efficient Method for Association Rule Mining in Relational Databases. In: Elserier Data and Knowledge, Engineering, pp. 47–64 (2001)
Cheung, D.W., Han, J., Ng, V.T., Fu, A.W., Fu, Y.: A fast distributed algorithm for mining association rules. In: Proceedings of Int’l Conf. on PDIS 1996, Miami Beach, Florida, USA (1996)
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the 11th Int’l Conf. on Data Engineering, ICDE (1995)
Franklin, B.: Genealogical Data Mining (2006)
Yen, S.-J., Chen, A.L.P.: A Graph based Approach for Discovering Various Types of Association Rules. IEEE Transaction on Knowledge and Data Engineering 13(5), 839–845 (2001)
Srikant, R., Agrawal, R.: Mining Generalized Association rules. In: Proc. Of the 21st Int’l Conf. on Very Large Databases, Zurich, Switzerland, pp. 407–419 (1995)
Cakmak, A., Ozsoyoglu, G.: Taxonomy superimposed graph mining. In: Proceedings of the 11th Int’l Conf. on Extending Database Technology, Advances in Database Technology. ACM Int’l Conf. Proceeding Series, vol. 261, pp. 217–228 (2008)
Silvescu, A., Caragea, D., Atramentov, A.: Graph Databases Artificial Intelligence Research Laboratory. Department of Computer Science Iowa State University Ames, Iowa (2007)
Priyadarshini, S., Mishra, D.: A Hybridized Graph Mining Approach. In: Das, V.V., Vijaykumar, R. (eds.) ICT 2010. Communications in Computer and Information Science, vol. 101, pp. 356–361. Springer, Heidelberg (2010)
Pan, H., Tan, X., Han, Q., Yin, G.: An Effective Algorithm Based on Association Graph and Matrix for Mining Association Rules. In: Proceeding of IEEE 2010. IEEE PRESS (2010) 978-1-4244–6977-2/10
Muthukumar, A., Nadarajan, R.: Efficient and Scalable Partition based Algorithms for Mining Association Rules. Academic Open Internet Journal 19 (2006) ISSN 1311–4360
Balaji Raja, N., Balakrishnan, G.: Evaluation of Rule Likeness Measures for a Learning Environment. In: Proceedings of the ICOREM Int’l Conf., pp. 1682–1690. ICOREM (2009)
Balaji Raja, N., Balakrishnan, G.: A Model of Algorithmic Approach to Itemsets Using Association Rules. In: Proceedings of IEEE, ICECT 2011, pp. 6–10. IEEE PRESS (2011) 978-1-4244-8677-9
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Raja, N.B., Balakrishnan, G. (2012). An Innovative Approach to Association Rule Mining Using Graph and Clusters. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Computer Science and Information Technology. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27317-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-27317-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27316-2
Online ISBN: 978-3-642-27317-9
eBook Packages: Computer ScienceComputer Science (R0)