Efficient indexing structures for mining frequent patterns

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2002, Pages 453-462

  Lan, Bin ^a,b   Ooi, Beng Chin ^a   Tan, Kian Lee ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DIGITAL FILTERS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; HEURISTIC METHODS; INDEXING (OF INFORMATION); ITERATIVE METHODS; TREES (MATHEMATICS);

BIT-SLICED BLOOM-FILTERED SIGNATURE FILE (BBS);

DATA MINING;

EID: 0036208335     PISSN: 10844627     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICDE.2002.994758     Document Type: Article

References (16)

1. Fast algorithms for mining association rules
2. Space/time trade-offs in hash coding with allowable errors
3. Dynamic intemset counting and implication rules for market basket data
4. Finding interesting associations without support pruning
5. Computing iceberg queries efficiently
6. Efficient mining of constrained correlated sets
7. Mining frequent patterns without candidata generation
8. Rule-assisted prefetching in web-server caching
9. Exploratory mining and pruning optimizations of constrained associations rules
10. An effective hash-based algorithm for mining association rules
11. Partial-match retrieval via the method of super-imposed code
12. Multi-key access methods based on superimposed coding techniques
13. Integrating association rule mining with relational database systems: Alternatives and implications