Abstract
This paper proposes a frequent closed itemsets mining algorithm based on FP-tree and COFI-tree. This algorithm adopts a relatively small independent tree called COFI-tree. COFI-Tree doesn’t need to construct conditional FP-Tree recursively and there is only one COFI-Tree in memory at a time, therefore this new mining algorithm reduces memory usage. Experiment shows that the new approach outperforms similar state-of-the-art algorithms when mining extremely large datasets in terms of execution time.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Pei, J., Han, J., Mao, R.: An efficient algorithm for mining frequent closed itemsets. In: Gunopulos, D., et al. (eds.) Proc. of the 2000 ACM SIGMOD Int’l. Workshop on Data Mining and Knowledge Discovery, ACM Press, Dallas (2000)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: 2000 ACM SIGMOD Intl. Conference on Management of Data, pp. 1–12 (2000)
El-Hajj, M., Zaiane, O.R.: Non recursive generation of frequent k-itemsets from frequent pattern tree representations. In: Proc. of 5th International Conference on Data Warehousing and Knowledge Discovery, DaWak 2003 (2003)
Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A Tree-Based Approach for Frequent Pattern Mining from Uncertain Data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 653–661. Springer, Heidelberg (2008)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc.1994 Int. Conf. Very Large Data Bases, Santiago, Chile, pp. 487–499 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, J., Cui, X., Chen, J. (2011). Frequent Closed Pattern Mining Algorithm Based on COFI-Tree. In: Deng, H., Miao, D., Wang, F.L., Lei, J. (eds) Emerging Research in Artificial Intelligence and Computational Intelligence. AICI 2011. Communications in Computer and Information Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24282-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-24282-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24281-6
Online ISBN: 978-3-642-24282-3
eBook Packages: Computer ScienceComputer Science (R0)