Abstract
To solve the problem of huge memory usage of FP-tree construction and traversal in FP-growth, Dynamic-prune, which is a concurrent frequent itemsets mining algorithm based on FP-tree is proposed. On the one hand, by recording the change of support counts of frequent items during the process of FP-tree construction, dynamic FP-tree pruning is implemented. And the rationality is discussed. On the other hand, by using the concurrency strategy, the construction of FP-tree and the discovery of frequent itemsets can be realized simultaneously. Compared with FP-growth, it is not necessary to mine frequent itemsets after the construction of the whole FP-tree in Dynamic-prune. Experimental results show Dynamic-prune is efficient and scalable.
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
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: 20th International Conference on Very Large Data Bases, pp. 487–499. Morgan Kaufmann, Santiago de Chile (1994)
Pietracaprina, A., Riondato, M., Upfal, E., Vandin, F.: Mining Top-K Frequent Itemsets Through Progressive Sampling. Data Min. Knowl. Discov. 21, 310–326 (2010)
Song, W., Yang, B.R., Xu, Z.Y.: Index-BitTableFI: An Improved Algorithm for Mining Frequent Itemsets. Knowl.-Based Syst. 21, 507–513 (2008)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Min. Knowl. Discov. 8, 53–87 (2004)
Grahne, G., Zhu, J.: Fast Algorithms for Frequent Itemset Mining using FP-Trees. IEEE Trans. Knowl. Data Eng. 17, 1347–1362 (2005)
Liu, G., Lu, H., Yu, J.X.: CFP-Tree: A Compact Disk-Based Structure for Storing and Querying Frequent Itemsets. Inform. Syst. 32, 295–319 (2007)
Roscoe, A.W.: Understanding Concurrent Systems. Springer, London (2010)
Requent Itemset Mining Implementations Repository, http://fimi.ua.ac.be
IBM Quest Market-Basket Synthetic Data Generator, http://www.cs.loyola.edu/~cgiannel/assoc_gen.html
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
Song, W., Liu, W., Li, J. (2012). Dynamic FP-Tree Pruning for Concurrent Frequent Itemsets Mining. In: Li, Z., Li, X., Liu, Y., Cai, Z. (eds) Computational Intelligence and Intelligent Systems. ISICA 2012. Communications in Computer and Information Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34289-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-34289-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34288-2
Online ISBN: 978-3-642-34289-9
eBook Packages: Computer ScienceComputer Science (R0)