Abstract
Strong association rules are one of basic types of knowledge. The number of rules is often huge, which limits their usefulness. Applying concise rule representations with appropriate inference mechanisms can lessen the problem. Ideally, a rule representation should be lossless (should enable derivation of all strong rules), sound (should forbid derivation of rules that are not strong) and informative (should allow determination of rules’ support and confidence). In the paper, we overview the following lossless representations: representative rules, Duquenne- Guigues basis, proper basis, Luxenburger basis, structural basis, minimal non-redundant rules, generic basis, informative basis and its transitive reduction. For each representation, we examine whether it is sound and informative. For the representations that are not sound, we discuss ways of turning them into sound ones. Some important theoretical results related to the relationships among the representations are offered as well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal C., Yu P.: On Line Generation of Association Rules. In: Proc. of ICDE-98, (1998) 402–411
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
Bastide Y., Pasquier N., Taouil R., Stumme G., Lakhal L.: Mining Minimal Nonredundant Association Rules Using Frequent Closed Itemsets. CL (2000) 972–986
Kryszkiewicz, M.: Representative Association Rules. In: Proc. of PAKDD’ 98. Melbourne, Australia. LNAI 1394. Springer-Verlag (1998) 198–209
Kryszkiewicz M.: Closed Set Based Discovery of Representative Association Rules. In: Proc. of IDA’2001. September 13–15, Lisbon, Portugal. LNCS. Springer (2001) 350–359
Kryszkiewicz, M.: Concise Representation of Frequent Patterns based on Disjunction-free Generators. In: Proc. of ICDM’ 2001. San Jose, USA. IEEE Comp. SC. Press (2001) 305–312
Kryszkiewicz M., Concise Representations of Frequent Patterns and Association Rules. Habilitation dissertation, submitted to Warsaw University of Technology
Luong V.P., Representative Bases of Association Rules. In: Proc. of ICDM’ 2001. San Jose, USA. IEEE Comp. SC. Press (2001) 639–640
Luxenburger, M.: Implications Partielles dans un Contexte, Mathématiques, informatique et sciences humaines, 113, (1991) 35–55
Pasquier, N.: DM: Algorithmes d’extraction et de réduction des regles d’association dans les bases de données. Ph.D. Thesis. Univ. Pascal-Clermont-Ferrand II (2000)
Stumme G., Taouil R., Bastide Y., Pasquier N., Lakhal L.: Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis. KI/ÖGAI (2001), 335–350
Zaki, M.J.: Generating Non-redundant Association Rules. In: 6th ACM SIGKDD (2000)
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
Kryszkiewicz, M. (2002). Concise Representations of Association Rules. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds) Pattern Detection and Discovery. Lecture Notes in Computer Science(), vol 2447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45728-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-45728-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44148-9
Online ISBN: 978-3-540-45728-2
eBook Packages: Springer Book Archive