Reducing borders of k-disjunction free representations of frequent patterns

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2004, Pages 559-563

  Kryszkiewicz, Marzena ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Concise representations; Data mining; Frequent patterns; Knowledge discovery

Indexed keywords

DATA MINING; KNOWLEDGE ACQUISITION; PATTERN RECOGNITION; RELATIONAL DATABASE SYSTEMS; SET THEORY;

CONCISE REPRESENTATIONS; FREQUENT PATTERNS; REDUCING BORDERS; TRANSACTIONAL DATABASE;

OBJECT ORIENTED PROGRAMMING;

EID: 2442604532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.968017     Document Type: Conference Paper

References (10)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I. Fast Discovery of Association Rules, Advances in KD and DM. AAAI, CA, 1996.
2. Bykowski, A., Rigotti, C. A Condensed Representation to Find Patterns, in Proc. of PODS '01, ACM, 2001, 267-273.
3. Calders, T., Goethals, B. Mining All Non-derivable Frequent Itemsets, in Proc. of PKDD '02, Springer, 2002, 74-85.
4. Calders, T., Goethals, B. Minimal k-free Representations, in Proc. of ECML/PKDD '03, 2003.
5. Han, J., Kamber, M. Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, 2000.
6. Jeudy B., Boulicaut J.-F. Constraint-Based Discovery and Inductive Queries: Application to Association Rule Mining, Pattern Detection and Discovery, Springer, 2002, 110-124.
7. Kryszkiewicz, M. Concise Representation of Frequent Patterns based on Disjunction-free Generators, in Proc. of ICDM' 01, IEEE Computer Society, 2001, 305-312.
8. Kryszkiewicz, M., Gajek, M. Concise Representation of Frequent Patterns based on Generalized Disjunction-Free Generators, in Proc.of PAKDD'02, Springer, 2002, 159-171.
9. Kryszkiewicz, M. Concise Representation of Frequent Patterns and Association Rules, Habilitation Thesis, Publishing House of Warsaw Univ. of Technology, 2002.
10. Pasquier N., Bastide Y., Taouil R., Lakhal L. Discovering Frequent Closed Itemsets for Association Rules, in Proc. of ICDT '99, Springer, 1999, 398-416.