Abstract
Data mining is the process of extracting interesting and previously unknown patterns and correlations from data stored in Data Base Management Systems (DBMSs). Association Rule Mining is the process of discovering items, which tend to occur together in transactions. Efficient algorithms to mine frequent patterns are crucial to many tasks in data mining. The task of mining association rules consists of two main steps. The first involves finding the set of all frequent itemsets. The second step involves testing and generating all high confidence rules among itemsets. Our paper deals with obtaining both the frequent itemsets as well as generating association rules among them.
In this paper we implement the FORC (Fully Organized Candidate Generation) algorithm, which is a constituent of the Viper algorithm for generating our candidates and subsequently our frequent itemsets. Our implementation is an improvement over Apriori, the most common algorithm used for frequent item set mining.
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
Shenoy, P., Bawa, M., Shah, D.: Turbo-charging Vertical Mining of large databases. In: Proceedings of ACM SIGMOD Intl. Conference on Mgmt of Data (2000)
Mobasher, B., Cooley, R., Srivastava, J.: Web mining: Information and pattern discovery on the World Wide Web. In: 9th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 1997 (1997)
Agrawal, R., Imielinski, T., Swamy, A.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD Intl. Conference on Management of Data (1993)
Bodon, F.: A Fast Apriori Implementation. Computer and Automation Research Institute. Hungarian Academy of Sciences, Budapest (2012)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of 20th Intl. Conf. Very Large Databases, VLDB (1994)
Golomb, S.W.: Run Length Encoding. IEEE Transactions on Information Theory 12(3) (1966)
Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: Proc. of 21st Intl. Conf. on Very Large Databases, VLDB (1995)
Chen, M., Han, J., Yu, P.S.: Data Mining: An Overview from a Database Perspective. TKDE 8(6) (December 1996)
Adriaans, P., Zantinge, D.: Data Mining. Addison-Wesley (1996)
Agrawal, R., Imielinski, T., Swami, A.: Database Mining: A Performance Perspective. TKDE 5(6) (December 1993)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann (2001)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. SIGMOD (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagesh, H.R., Bharath Kumar, M., Ravinarayana, B. (2013). Improved Implementation and Performance Analysis of Association Rule Mining in Large Databases. In: Unnikrishnan, S., Surve, S., Bhoir, D. (eds) Advances in Computing, Communication, and Control. ICAC3 2013. Communications in Computer and Information Science, vol 361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36321-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-36321-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36320-7
Online ISBN: 978-3-642-36321-4
eBook Packages: Computer ScienceComputer Science (R0)