Top down FP-growth for association rule mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2336, Issue , 2002, Pages 334-340

  Wang, Ke ^a   Tang, Liu ^a   Han, Jiawei ^a   Liu, Junqiang ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; FORESTRY;

BOTTOM UP; FP GROWTHS; FP TREE; MINE ASSOCIATION RULES; MULTIPLE MINIMUM SUPPORTS; PRUNING STRATEGY; SEARCH SPACES; TOP-DOWN SEARCHES;

DATA MINING;

EID: 84945313061     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47887-6_34     Document Type: Conference Paper

References (8)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. ACM-SIGMOD 1993, 207-216.
2. H. Toivonen. Sampling large databases for association rules. VLDB 1996, 134-145.
3. R. Agrawal and S. Srikant. Mining sequential patterns. ICDE 1995, 3-14.
4. J. Han, J. Pei and Y. Yin. Mining Frequent patterns without candidate generation. SIGMOD 2000, 1-12.
5. R. Srikant and R. Agrawal. Mining generalized association rules. VLDB 1995, 407-419.
6. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. VLDB 1996, 134-145.
7. B. Liu, W. Hsu, and Y. Ma. Mining association rules with multiple minimum supports. KDD 1999, 337-341
8. K. Wang, Y. He and J. Han. Mining frequent patterns using support constraints. VLDB 2000, 43-52.