Abstract
Mining generalized association rules among items in the presence of taxonomy and with nonuniform minimum support has been recognized as an important model in the data mining community. In real applications, however, the work of discovering interesting association rules is an iterative process; the analysts have to continuously adjust the constraint of minimum support to discover real informative rules. How to reduce the response time for each remining process thus becomes a crucial issue. In this paper, we examine the problem of maintaining the discovered multi-supported generalized association rules when the multiple minimum support constraint is refined and propose a novel algorithm called RGA_MSR to accomplish the work. By keeping and utilizing the set of frequent itemsets and negative border, and adopting vertical intersection counting strategy, the proposed RGA_MSR algorithm can significantly reduce the computation time spent on rediscovery of frequent itemsets and has very good performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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: Proc. 1993 ACM-SIGMOD Intl. Conf. Management of Data, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 20th Intl. Conf. Very Large Data Bases, pp. 487–499 (1994)
Ayan, N.F., Tansel, A.U., Arkun, M.E.: An Efficient Algorithm to Update Large Itemsets with Early Pruning. In: Proc. of the 5th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (KDD 1999), San Diego, CA, USA, pp. 287–291 (1999)
Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. SIGMOD Record 26, 255–264 (1997)
Cheung, D.W., Lee, S.D., Kao, B.: A General Incremental Technique for Maintaining Discovered Association Rules. In: Proc. DASFAA 1997, pp. 185–194 (1997)
Han, J., Fu, Y.: Discovery of Multiple-level Association Rules from Large Databases. In: Proc. 21st Intl. Conf. Very Large Data Bases, Zurich, Switzerland, pp. 420–431 (1995)
Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: Proc. 5th Intl. Conf. Knowledge Discovery and Data Mining, pp. 337–341 (1999)
Park, J.S., Chen, M.S., Yu, P.S.: An Effective Hash-based Algorithm for Mining Association Rules. In: Proc. 1995 ACM SIGMOD Intl. Conf. on Management of Data, San Jose, CA, USA, pp. 175–186 (1995)
Sarda, N.L., Srinivas, N.V.: An Adaptive Algorithm for Incremental Mining of Association Rules. In: Proc. 9th Intl. Workshop on Database and Expert Systems Applications, pp. 240–245 (1998)
Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. 21st Intl. Conf. Very Large Data Bases, pp. 432–444 (1995)
Srikant, R., Agrawal, R.: Mining Generalized Association Rules. In: Proc. 21st Intl. Conf. Very Large Data Bases, pp. 407–419 (1995)
Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In: Proc. 3rd Intl. Conf. Knowledge Discovery and Data Mining (1997)
Toivonen, H.: Sampling Large Databases for Association Rules. In: Proc. 22nd Intl. Conf. on Very Large Data Bases, Mumbai, India, pp. 134–145 (1996)
Tseng, M.C., Lin, W.Y.: Mining Generalized Association Rules with Multiple Minimum Support. In: Proc. Intl. Conf. Data Warehousing and Knowledge Discovery, pp. 11–20 (2001)
Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(2), 372–390 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tseng, MC., Lin, WY., Jeng, R. (2005). Efficient Remining of Generalized Association Rules Under Multiple Minimum Support Refinement. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_186
Download citation
DOI: https://doi.org/10.1007/11553939_186
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28896-1
Online ISBN: 978-3-540-31990-0
eBook Packages: Computer ScienceComputer Science (R0)