Finding interesting associations without support pruning

IEEE Transactions on Knowledge and Data Engineering

Volumn 13, Issue 1, 2001, Pages 64-78

  Cohen, Edith ^a,b   Datar, Mayur ^d   Fujiwara, Shinji ^a,c   Gionis, Aristides ^a,d   Indyk, Piotr ^d   Motwani, Rajeev ^a,d   Ullman, Jeffrey D ^d   Yang, Cheng ^d  

^a IEEE

^b AT AND T LABS RESEARCH   (United States)

^c HITACHI LTD   (Japan)

^d Stanford University   (United States)

Author keywords

Association rules; Data mining; Locality sensitive hashing; Min hashing; Similarity metric

Indexed keywords

HASHING TECHNIQUES;

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; PROBLEM SOLVING;

DATA MINING;

EID: 0035051307     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.908981     Document Type: Conference Paper

References (17)

1. Mining association rules between sets of items in large databases
2. Fast algorithms for mining association rules
3. Dynamic itemset counting and implication rules for market basket data
4. On the resemblance and containment of documents
5. Size-estimation framework with applications to transitive closure and reachability
6. Similarity search in high dimensions via hashing
7. Using collaborative filtering to weave an information tapestry
8. CURE - An efficient clustering algorithm for large databases
9. Online aggregation
10. Approximate nearest neighbor: Towards removing the curse of dimensionality
11. Building a scalable and accurate copy detection mechanism
12. Beyond market baskets: Generalizing association rules to dependence rules
13. Scalable techniques for mining causal structures
14. CACM Special Issue on Recommender Systems