Abstract
Mining of frequent patterns has been studied popularly in data mining area. However, very little work has been done on the problem of updating mined patterns upon threshold changes, in spite of its practical benefits. When users interactively mine frequent patterns, one difficulty is how to select an appropriate minimum support threshold. So, it is often the case that they have to continuously tune the threshold. A direct way is to re-execute the mining procedure many times with varied thresholds, which is nontrivial in large database. In this paper, an efficient Extension and Re-mining algorithm is proposed for update of previously discovered frequent patterns upon threshold changes. The algorithm proposed in this paper has been implemented and its performance is compared with re-running FP-growth algorithm under different thresholds. The study shows that our algorithm is significantly faster than the latter, especially when mining long frequent patterns in large databases.
This work is supported by the National Grand Fundamental Research 973 Program of China under Grant No.G1999032705
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
R. Agrawal and R. Srikant. Fast algorithm for mining Association rules. In VLDB’94, (1994) 487–499.
S. Brin, R. Motwani, and C. Silverstein. Beyond market basket: Generatalizing association rules to correlations. In SIGMOD’97, (1997) 265–276.
R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE’95, (1995) 3–14.
J. Han, J. Pei, Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD’00, (2000) 1–12
J. Han and J. Pei Mining frequent patterns by pattern-growth: methodology and implications In SIGKDD’00, (2000) 14–20.
D. Cheung, J. Han, V. Ng, C. Wong Maintenance of discovered association rules in large databases: An incremental updating technique. In ICDE’96. (1996)
D. Cheung, S. Lee, B. Kao A general incremental technique for maintaining discovered association rules. In Proceedings of the 5th International Conference on Database Systems for Advanced Applications, (1997).
S. Lee and D. Cheung Maintenance of discovered association rules: When to update? In DMKD’97. (1997)
Feng Yu-cai, Feng Jian-lin Incremental updating algorithms for Mining association rules In Journal Of Software, Vol. 9, No. 4, (1998) 301–306.
OU-YANG Weimin, CAI Qing-sheng An incremental updating technique for discovered generalized sequential patterns In Journal Of Software, Vol. 9, No. 10, (1998) 777–780.
J. Liu and J. Yin Towards efficient data re-mining (DRM) In PAKDD’01, (2001). 406–412.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, Xl., Tang, Sw., Yang, Dq., Du, Xp. (2002). Towards Efficient Re-mining of Frequent Patterns upon Threshold Changes. In: Meng, X., Su, J., Wang, Y. (eds) Advances in Web-Age Information Management. WAIM 2002. Lecture Notes in Computer Science, vol 2419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45703-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-45703-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44045-1
Online ISBN: 978-3-540-45703-9
eBook Packages: Springer Book Archive