Abstract
Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold. Many approaches have been proposed for mining frequent pattern. However, either the search space or memory space is huge, such that the performance for the previous approach degrades when the database is massive or the threshold for mining frequent patterns is low. In order to decrease the usage of memory space and speed up the mining process, we study some methods for mining frequent patterns based on frequent pattern tree. The concept of our approach is to only construct a FP-tree and traverse a subtree of the FP-tree to generate all the frequent patterns for an item without constructing any other subtrees. After traversing a subtree for an item, our approach merges and removes the subtree to reduce the FP-tree smaller and smaller. We propose four methods based on this concept and compare the four methods with the famous algorithm FP-Growth which also construct a FP-tree and recursively mines frequent patterns by building conditional FP-tree.
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
Agarwal, R., Aggarwal, C., Prasad, V.: A tree projection algorithm for generation of frequent itemsets. Parallel and distributed Computing 61, 350–371 (2000)
Agarwal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 1994 Int. Conf. Very Large Data Bases, Santiago, Chile, pp. 487–499 (September 1994)
Chen, M., Park, J., Yu, P.: An Effective Hash-Based Algorithm for Mining Association Rules. Proceedings of ACM SIGMOD 24(2), 175–186 (1995)
Han, J., Mao, R., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data mining and knowledge discovery 8, 53–87 (2004)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM-SIGMOD, Dallas (2000)
Yen, S.J., Chen, A.L.P.: A Graph-Based Approach for Discovering Various Types of Association Rules. IEEE Transactions on Knowledge and Data Engineering (TKDE) 13(5), 839–845 (2001)
IBM Almaden. Quest synthetic data generation code, http://www.almaden.ibm.com/cs/quest/syndata.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yen, SJ., Lee, YS., Wang, CK., Wu, JW., Ouyang, LY. (2009). The Studies of Mining Frequent Patterns Based on Frequent Pattern Tree. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, TB. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2009. Lecture Notes in Computer Science(), vol 5476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01307-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-01307-2_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01306-5
Online ISBN: 978-3-642-01307-2
eBook Packages: Computer ScienceComputer Science (R0)