Non recursive generation of frequent K-itemsets from frequent pattern tree representations

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

Volumn 2737, Issue , 2003, Pages 371-380

  El Hajj, Mohammad ^a   Zaïane, Osmar R ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; DATA MINING; DATA WAREHOUSES; STRUCTURES (BUILT OBJECTS);

FP TREE; FREQUENT PATTERN TREE; INDEPENDENT TREES; ITEM SETS; MAIN MEMORY; MEMORY RESOURCES; MINING PROCESS; RULE MINING ALGORITHMS;

TREES (MATHEMATICS);

EID: 35248897681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45228-7_37     Document Type: Article

References (8)

1. R. Agarwal, C. Aggarwal, and V. Prasad. A tree projection algorithm for generation of frequent itemsets. Parallel and distributed Computing, 2000.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases, pages 487-499, Santiago, Chile, September 1994.
3. IBM. Almaden. Quest synthetic data generation code. http://www.almaden.ibm.com/cs/quest/syndata.html.
4. ∼borgelt/apriori/apriori.html.
5. E.-H. Han, G. Karypis, and V. Kumar. Scalable parallel data mining for association rule. Transactions on Knowledge and data engineering, 12(3):337-352, May-June 2000.
6. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM-SIGMOD, Dallas, 2000.
7. H. Huang, X. Wu, and R. Relue. Association analysis with one scan of databases. In IEEE International Conference on Data Mining, pages 629-636, December 2002.
8. J. Liu, Y. Pan, K. Wang, and J. Han. Mining frequent item sets by opportunistic projection. In Eight ACM SIGKDD Internationa Conf. on Knowledge Discovery and Data Mining, pages 229-238, Edmonton, Alberta, August 2002.