Why to apply generalized disjunction-free generators representation of frequent patterns?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2366 LNAI, Issue , 2002, Pages 383-392

  Kryszkiewicz, Marzena ^a   Gajek, Marcin ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLOSED ITEMSETS; DATA SET; EPISODE RULES; FREQUENT CLOSED ITEMSETS; ITEM SETS; LOSSLESS; SEQUENTIAL PATTERNS;

INTELLIGENT SYSTEMS;

EID: 84884602907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48050-1_42     Document Type: Conference Paper

References (8)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in KDD. AAAI, Menlo Park, California (1996) 307-328
2. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Nonredundant Association Rules Using Frequent Closed Itemsets. CL (2000) 972-986
3. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations, Vol. 2(2). (2000) 66-75
4. Bykowski, A., Rigotti, C.: A Condensed Representation to Find Frequent Patterns. In: Proc. of the 12th ACM SIGACT-SIGMOD-SIGART PODS' 01 (2001)
5. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann (2000)
6. Kryszkiewicz, M.: Closed Set based Discovery of Representative Association Rules. In: Proc. of IDA '01. Springer (2001) 350-359
7. Kryszkiewicz, M.: Concise Representation of Frequent Patterns based on Disjunction-Free Generators. In: Proc. of ICDM '01. IEEE (2001) 305-312
8. Kryszkiewicz, M., Gajek, M.: Concise Representation of Frequent Patterns based on Generalized Disjunction-Free Generators, PAKDD '02, to appear in a Springer volume