Abstract
The problem that we tackle here is a practical one: When users interactively mine association rules, it is often the case that they have to continuously tune two thresholds: minimum support and minimum confidence, which describe the users’ changing requirements. In this paper, we present an efficient data re-mining (DRM) technique for updating previously discovered association rules in light of threshold changes.
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., Imielinski, T., and Swami, T.: Mining association rules between sets of items in large databases. Proceedings of the ACM-SIGMOD International Conference on Management of Data (1993) 207–216.
Agrawal, R. and Srikant, R.: Fast algorithm for mining association rules. Proceedings of the International Conference on Very Large Data Bases (1994) 487–499.
Srikant, R. and Agrawal, R.: Mining generalized association rules. Proceedings of the International Conference on Very Large Data Bases (1995) 407–419.
Park, J.S., Chen, M., and Yu, P.S.: An effective hash-based algorithm for mining association rules. Proceedings of the ACM-SIGMOD International Conference Management of Data (1995) 175–186.
Han, J., Cai, Y., and Cercone, N.: Data-driven discovery of quantitative rules in relational databases. IEEE Transactions on Knowledge and Data Engineering, 5(1):29–40, (1993).
Pei, J., Han, J., and Mao, R.: CLOSET: An efficient algorithm for mining frequent closed itemsets. Proceedings of the ACM-SIGMOD International Workshop on Data Mining and Knowledge Discovery (DMKD’00) (2000).
Lee, S.D. and Cheung, D.W.: Maintenance of discovered association rules: When to update? Proceedings of the ACM-SIGMOD Workshop on Data Mining and Knowledge Discovery (DMKD’97) (1997).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Yin, J. (2001). Towards Efficient Data Re-mining (DRM). In: Cheung, D., Williams, G.J., Li, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2001. Lecture Notes in Computer Science(), vol 2035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45357-1_43
Download citation
DOI: https://doi.org/10.1007/3-540-45357-1_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41910-5
Online ISBN: 978-3-540-45357-4
eBook Packages: Springer Book Archive