Abstract
Mining frequent patterns has been studied popularly in data mining research. For getting the real useful frequent patterns, one must continually adjust a minimum support threshold. Costly and repeated database scans were done due to not maintaining the frequent patterns discovered. In this paper, we first propose a top-down algorithm for mining frequent patterns, and then present a hybrid algorithm which takes top-down and bottom-up strategies for incremental maintenance of frequent patterns. Efficiency is achieved with the following techniques: large database is compressed into a highly condensed and dynamic frequent pattern tree structure, which avoids repeated database scans, the top-down mining approach adopts a depth first method to avoid the recursive construction and materialization of conditional frequent pattern trees, which dramatically reduces the mining cost. The performance study shows that our algorithm is efficient and scalable for mining frequent patterns, and is an order of magnitude faster than FP_growth and Re-mining.
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., Imielinski, T., Swami, A.: Mining Association rules between Sets of Items in Large Databases. In: Intl Proc of the 1993 ACM SIGMOD, Washington D.C, pp. 207–216 (1993)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Intl. Proc. of the 2000 ACM SIGMOD, Dallas, pp. 1–12 (2000)
Agrawal, R., Strikant, R.: Fast Algorithms for mining association rules. In: 20th Intl. Proc. of the 1994 VLDB, Santiago, pp. 487–499 (1994)
Ma, X., Tang, S., Yang, D., et al.: Towards Efficient Re-mining of Frequent Pattern upon Threshold Changes. In: Meng, X., Su, J., Wang, Y. (eds.) WAIM 2002. LNCS, vol. 2419, pp. 80–88. Springer, Heidelberg (2002)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Intl Proc of the 1996 Data Engineering. New Orleans (1996)
Zhou, Z., Ezeife, C.: A Low-Scan Incremental Association Rule Maintenance Method Based on the Apriori Property. In: Proc of the 2001 on AI. Canadian (2001)
Feng, Y., Feng, J.: Incremental Updating Algorithms for mining Association Rules. Journal of Software 9(4), 301–305 (1998)
Park, J., Chen, M., Yu, P.: An Effective Hash-Based Algorithm for Mining Association rules. In: Intl. Proc. of the 1995 ACM SIGMOD, San Jose (1995)
Bodon, F.: A Fast Apriori Implementation. In: Proc of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations Repository. Melbourne, Florida (2003)
Rozenberg, B., Gudes, E.: Association Rules Mining in Vertically Partitioned Databases. Data & Knowledge Engineering 59(2), 378–396 (2006)
Palashikar, G., Kale, M., Apte, M.: Association Rules Mining Using Heavy Itemsets. Data & Knowledge Engineering, Articles in Press
Chen, T., Hsu, S.: Mining Frequent Tree-Like Patterns in large datasets. Data & Knowledge Engineering (2006)
Xin, D., Han, J., Yan, X., et al.: On Compressing Frequent Patterns. Data & Knowledge Engineering (2006)
Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: 21th Intl Proc of the 1995 VLDB, San Francisco (1995)
Toivonen, H.: Sampling Large Databases for Association Rules. In: 22nd Intl Proc of the 1996 VLDB. Bombay (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, Q., Lin, X. (2007). Top-Down and Bottom-Up Strategies for Incremental Maintenance of Frequent Patterns. In: Washio, T., et al. Emerging Technologies in Knowledge Discovery and Data Mining. PAKDD 2007. Lecture Notes in Computer Science(), vol 4819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77018-3_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-77018-3_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77016-9
Online ISBN: 978-3-540-77018-3
eBook Packages: Computer ScienceComputer Science (R0)