Parallelizing frequent itemset mining with FP-trees

21st International Conference on Computers and Their Applications, CATA 2006

Volumn , Issue , 2006, Pages 30-35

  Tang, Peiyi ^a   Turkia, Markus P ^a  

^a University of Arkansas at Little Rock ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; FP TREE; FREQUENT ITEMSET; FREQUENT ITEMSET MINING; PARALLEL TASK; PARALLELIZING; SEARCH SPACES;

FORESTRY;

COMPUTER APPLICATIONS;

EID: 70449520684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Bart Goethals and Mohammed J. Zaki. FIMI'03: Workshop on frequent itemset mininig implementa- Tions. Technical report, http://fimi.cs.helsinki.fi/2003.
2. R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Database, pages 207- 216, 1993.
3. R. Agrawal and J. C. Shafer. Parallel mining of association rules. IEEE Transactions On Knowledge And Data Engineering, 8:962-969, 1996.
4. M. J. Zaki, M. Ogihara, S. Parthasarathy, and W. Li. Parallel data mining for association rules on shared- memory multiprocessors. In Proceedings of the 1996 ACM/IEEE conference on Supercomputing. Article No. 43, 1996.
5. Mohammed J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3):372-390, 2000.
6. Dejiang Jin and Sotirios G. Ziavras. A super- programming approach for mining association rules in parallel on pc clusters. IEEE Transactions on Parallel and Distributed Systems, 15:783-794, 2004.
7. Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International on Management of Data, pages 1-12. ACM Press, 2000.
8. rd Annual Association for Computing Machinery Southeast Conference (ACMSE'05), volume 1, pages 250-255, Atlanta, USA, March 2005.
9. Peiyi Tang and Pen-Chung Yew. Processor self- scheduling for multiple-nested parallel loops. In Proceedings of the 1986 International Conference on Parallel Processing (ICPP'86), pages 528-535, August 1986.
10. Peiyi Tang and Markus P. Turkia. Parallelizing frequent itemset mining with FP-trees. Technical Report titus.compsci.ualr.edu/~ptang/papers/par-.pdf, Department of Computer Science, University of Arkansas at Little Rock, 2005.
11. Yin ling Cheung. FP-tree/FP-growth: Mining large itemsets using FP-tree algorithm. Technical Report www.cse.cuhk.edu.hk/~kdd/freq/Nmost/ftp.zip, Chinese University of Hong Kong, 2002.