Abstract
The discovery of frequent patterns is one of the most important issues in the data mining area. A major difficulty concerning frequent patterns is huge amount of discovered patterns. The problem can be solved or at least significantly alleviated by applying concise representations of frequent patterns. A number of most concise representations use generalized disjunctive rules for reasoning about patterns. Recently, the representation based on essential patterns has been introduced, but was not confronted with the representations using generalized disjunctive rules. In this paper, we 1) prove that essential patterns with at least two elements can be defined equivalently in terms of generalized disjunctive rules of a particular subtype and that singleton patterns are essential if their supports do not equal 0, 2) identify the relationship between compressed disjunction-free patterns and essential ones, 3) propose new lossless representation E-CDFR of frequent patterns that is primarily based on compressed disjunction-free patterns and uses generalized disjunctive rules to reason about other patterns, 4) prove that the new representation is never less concise than the representation based on essential patterns.
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.
Similar content being viewed by others
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: ACM SIGMOD, Washington, USA, pp. 207–216 (1993)
Bykowski, A., Rigotti, C.: A Condensed Representation to Find Frequent Patterns. In: PODS 2001. ACM SIGACT-SIGMOD-SIGART, USA, pp. 267–273 (2001)
Calders, T., Goethals, B.: Non-Derivable Itemset Mining. In: Data Mining and Knowledge Discovery, vol. 14, pp. 171–206. Kluwer Academic Publishers, Dordrecht (2007)
Casali, A., Cicchetti, R., Lakhal, L.: Essential Patterns: A Perfect Cover of Frequent Patterns. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 428–437. Springer, Heidelberg (2005)
Hamrouni, T.: Mining Concise Representations of Frequent Patterns through Conjunctive and Disjunctive Search Spaces, Ph.D. thesis submitted to University of Tunis el Manar and University of Artois (2009)
Kryszkiewicz, M.: Concise Representation of Frequent Patterns Based on Disjunction–Free Generators. In: ICDM 2001, San Jose, California, USA, pp. 305–312 (2001)
Kryszkiewicz, M.: Concise Representations of Frequent Patterns and Association Rules. Publishing House of Warsaw University of Technology, Warsaw (2002)
Kryszkiewicz, M.: Reducing Infrequent Borders of Downward Complete Representations of Frequent Patterns. In: The First Symposium on Databases, Data Warehousing and Knowledge Discovery, Baden-Baden, Germany, pp. 29–42 (2003)
Kryszkiewicz, M.: Generalized Disjunction-Free Representation of Frequent Patterns with Negation. J. JETAI, 63–82 (2005)
Kryszkiewicz, M.: Non-derivable Item Set and Non-derivable Literal Set Representations of Patterns Admitting Negation. In: Pederson, T.B., Mohania, M.K., Tjoa, A.M. (eds.) PAKDD 2002. LNCS, vol. 5691, pp. 138–150. Springer, Heidelberg (2009)
Kryszkiewicz, M., Gajek, M.: Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 159–171. Springer, Heidelberg (2002)
Kryszkiewicz, M., Rybiński, H., Gajek, M.: Dataless Transitions between Concise Representations of Frequent Patterns. J. Int. Inf. Systems 22(1), 41–70 (2004)
Mannila, H., Toivonen, H.: Multiple Uses of Frequent Sets and Condensed Representations. In: KDD 1996, Portland, USA, pp. 189–194 (1996)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. J. Inf. Systems 24(1), 25–46 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kryszkiewicz, M. (2009). Compressed Disjunction-Free Pattern Representation versus Essential Pattern Representation. In: Corchado, E., Yin, H. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2009. IDEAL 2009. Lecture Notes in Computer Science, vol 5788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04394-9_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-04394-9_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04393-2
Online ISBN: 978-3-642-04394-9
eBook Packages: Computer ScienceComputer Science (R0)