Compressed Disjunction-Free Pattern Representation versus Essential Pattern Representation

  • Marzena Kryszkiewicz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5788)


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.


  1. 1.
    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)Google Scholar
  2. 2.
    Bykowski, A., Rigotti, C.: A Condensed Representation to Find Frequent Patterns. In: PODS 2001. ACM SIGACT-SIGMOD-SIGART, USA, pp. 267–273 (2001)Google Scholar
  3. 3.
    Calders, T., Goethals, B.: Non-Derivable Itemset Mining. In: Data Mining and Knowledge Discovery, vol. 14, pp. 171–206. Kluwer Academic Publishers, Dordrecht (2007)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Kryszkiewicz, M.: Concise Representation of Frequent Patterns Based on Disjunction–Free Generators. In: ICDM 2001, San Jose, California, USA, pp. 305–312 (2001)Google Scholar
  7. 7.
    Kryszkiewicz, M.: Concise Representations of Frequent Patterns and Association Rules. Publishing House of Warsaw University of Technology, Warsaw (2002)zbMATHGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Kryszkiewicz, M.: Generalized Disjunction-Free Representation of Frequent Patterns with Negation. J. JETAI, 63–82 (2005)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Kryszkiewicz, M., Rybiński, H., Gajek, M.: Dataless Transitions between Concise Representations of Frequent Patterns. J. Int. Inf. Systems 22(1), 41–70 (2004)Google Scholar
  13. 13.
    Mannila, H., Toivonen, H.: Multiple Uses of Frequent Sets and Condensed Representations. In: KDD 1996, Portland, USA, pp. 189–194 (1996)Google Scholar
  14. 14.
    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)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Marzena Kryszkiewicz
    • 1
  1. 1.Institute of Computer ScienceWarsaw University of TechnologyWarsawPoland

Personalised recommendations