Abstract
Mining around association rules discovered in a large database is an important problem. In the paper, we consider the case, when a user wants to mine around the given set of association rules, but does not have access to the original database. We show how to reason with a set of rules by means of the cover and extension operators. Since the number of association rules can be huge, we introduce the concept of maximal covering rules. The algorithms for mining with the cover and extension operators are offered.
Chapter PDF
Similar content being viewed by others
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data. Washington, D.C. (1993) 207–216
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, California (1996) 307–328
Kryszkiewicz, M.: Representative Association Rules. In: Proc. of PAKDD ’98. Melbourne, Australia. LNAI 1394. Springer-Verlag (1998) 198–209
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kryszkiewicz, M. (2000). Mining with Cover and Extension Operators. In: Zighed, D.A., Komorowski, J., Żytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2000. Lecture Notes in Computer Science(), vol 1910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45372-5_54
Download citation
DOI: https://doi.org/10.1007/3-540-45372-5_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41066-9
Online ISBN: 978-3-540-45372-7
eBook Packages: Springer Book Archive