Playing hide-and-seek with correlations

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2003, Pages 559-564

  Jermaine, Christopher ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Association rules; Correlations; Data mining; Minimum cut

Indexed keywords

CORRELATION ANALYSIS; HIGH-DIMENSIONAL; HUMAN INTERACTIONS; MINIMUM CUT; RUNNING TIME; SEARCH STRATEGIES; SHAVE-OFF; TECHNICAL DIFFICULTIES;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING; DATABASE SYSTEMS;

DATA MINING;

EID: 61349173123     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956819     Document Type: Conference Paper

References (9)

1. R. Agrawal, T. Imielinski, A. N. Swami: Mining association rules between sets of items in large databases. SIGMOD 1993:207-216
2. R. J. Bayardo Jr. Efficiently mining long patterns from databases. SIGMOD 1998:85-93
3. R. J. Bayardo Jr., R. Agrawal: Mining the most interesting rules. KDD 1999:145-154
4. A. V. Goldberg and R. E. Tarjan: A new approach to the maximum flow problem. JACM 35 (4):921-940 (1988)
5. J. Han, J. Pei, Y. Yin: Mining frequent patterns without candidate generation. SIGMOD 2000:1-12
6. D. S. Hochbaum: Approximating clique and biclique problems. J. Algorithms 29 (1):174-200 (1998)
7. C. Jermaine. Finding the most interesting correlations in a database... How hard can it be? To appear In Inf. Systems J.
8. S. Morishita, J. Sese: Traversing itemset lattice with statistical metric pruning. PODS 2000:226-236
9. G. I. Webb: Efficient search for association rules. KDD 2000:99-107