Abstract
Association rules mining (ARM) is one of the most useful techniques in the field of knowledge discovery and data mining and so on. Frequent item sets mining plays an important role in association rules mining. Apriori algorithm and FP-growth algorithm are famous algorithms to find frequent item sets. Based on analyzing on an association rule mining algorithm, a new association rule mining algorithm, called HSP-growth algorithm, is presented to generate the simplest frequent item sets and mine association rules from the sets. HSP-growth algorithm uses Huffman tree to describe frequent item sets. The basic idea and process of the algorithm are described and how to affects association rule mining is discussed. The performance study and the experimental results show that the HSP-growth algorithm has higher mining efficiency in execution time and is more efficient than Apriori algorithm and FP-growth algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)
Jitendra, A., Jain, R.C.: An Efficient Algorithm for Mining Frequent Itemsets. In: International Conference on Advances in Computing, Control, & Telecommunication Technologies, pp. 179–183 (2009)
Zhang, W., Liao, H., Zhao, N.: Research on the FP Growth Algorithm about Association Rule Mining. In: 2008 International Seminar on Business and Information Management, vol. 1, pp. 315–318 (2008)
Vivek, T., Vipin, T., Shailendra, G., Renu, T.: Association rule mining: A graph based approach for mining frequent itemsets. In: 2010 International Conference on Networking and Information Technology (ICNIT), pp. 309–313 (2010)
Han, J., Kamber, M.: Data Mining:concepts and techniques, 2nd edn. The Morgan Kaufmann Series in Data Management Systems (2006)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499 (1994)
Han, J., Pei, H., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. Conf. on the Management of Data (SIGMOD 2000), Dallas, TX, pp. 1–12. ACM Press (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, J., Ding, S. (2012). Research and Improvement on Association Rule Algorithm Based on FP-Growth. In: Wang, F.L., Lei, J., Gong, Z., Luo, X. (eds) Web Information Systems and Mining. WISM 2012. Lecture Notes in Computer Science, vol 7529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33469-6_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-33469-6_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33468-9
Online ISBN: 978-3-642-33469-6
eBook Packages: Computer ScienceComputer Science (R0)