A condensed representation to find frequent patterns

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 267-273

  Bykowski, A ^a   Rigotti, C ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATABASE SYSTEMS; FEATURE EXTRACTION; SET THEORY;

DISJUNCTION-FREE SETS;

DATA MINING;

EID: 0034832877     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.375604     Document Type: Conference Paper

References (11)

1. A tree projection algorithm for finding frequent itemsets
2. Fast discovery of association rules
3. Fast algorithms for mining association rules in large databases
4. Efficiently mining long patterns from databases
5. Approximation of frequency queries by mean of free-sets
6. Mining frequent patterns without candidate generation
7. Multiple uses of frequent sets and condensed representations
8. Levelwise search and borders of theories in knowledge discovery
9. Efficient mining of association rules using closed itemset lattices
10. Closet: An efficient algorithm for mining frequent closed itemsets
11. Sampling large databases for association rules