Abstract
Discovering association rules between items in a large database is an important database mining problem. The number of association rules may be huge. In this paper, we define a cover operator that logically derives a set of association rules from a given association rule. Representative association rules are defined as a least set of rules that covers all association rules satisfying certain user specified constraints. A user may be provided with a set of representative association rules instead of the whole set of association rules. The association rules, which are not representative ones, may be generated on demand by means of the cover operator. In this paper, we offer an algorithm computing representative association rules.
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
Agraval 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., May 1993, pp. 207–216.
Srikant R., Agraval R., Mining Generalized Association Rules. In Proc. of the 21st VLDB Conference, Zurich, Swizerland, 1995, pp. 407–419.
Imielinski T., Virmani A., Abdulghani A., Discover Board Application Programming Interface and Query Language for Database Mining. In Proc. of KDD '96, Portland Ore., August 1996, pp. 20–26.
Meo R., Psaila G., Ceri S., A New SQL-like Operator for Mining Asscociation Rules, Proc. of the 22nd VLDB Conference, Mumbai (Bombay), India, 1996.
Communications of the ACM, November 1996-Vol. 39, No 11.
Advances in Knowledge Discovery and Data Mining, eds. Menlo Park, California, 1996.
Piatetsky-Shapiro G., Discovery, Analysis and Presentation of Strong Rules. In Knowledge Discovery in Databases, G. Piatetsky-Shapiro, W. Frawley, eds., AAAI/MIT Press, Menlo Park, CA, 1991, pp. 229–248.
Agraval R., Mannila H., Srikant R., Toivonen H., Verkamo A.I., Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy, eds., AAAI, Menlo Park, California, 1996, pp. 307–328.
Savasere A, Omiecinski E., Navathe S., An Efficient Algorithm for Mining Association Rules in Large Databases. In Proc. of the 21st VLDB Conference, Zurich, Swizerland, 1995, pp. 432–444.
Houtsma M., Swami A., Set-oriented Mining of Association Rules. In Int'l Conference on Data Engineering, Taipei, Taiwan, March 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kryszkiewicz, M. (1998). Representative association rules. In: Wu, X., Kotagiri, R., Korb, K.B. (eds) Research and Development in Knowledge Discovery and Data Mining. PAKDD 1998. Lecture Notes in Computer Science, vol 1394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64383-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-64383-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64383-8
Online ISBN: 978-3-540-69768-8
eBook Packages: Springer Book Archive