Fast parallel association rule mining without candidacy generation
Authors:
- M. El-HajjMEM. El-Hajj
- P. LuPLP. Lu
- 14 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 665-668
Abstract
In this paper we introduce a new parallel algorithm MLFPT (multiple local frequent pattern tree) for parallel mining of frequent patterns, based on FP-growth mining, that uses only two full I/O scans of the database, eliminating the need for generating candidate items, and distributing the work fairly among processors. We have devised partitioning strategies at different stages of the mining process to achieve near optimal balancing between processors. We have successfully tested our algorithm on datasets larger than 50 million transactions.Keywords
This publication has 10 references indexed in Scilit:
- Fast parallel association rule mining without candidacy generation2002
- Mining recurrent items in multimedia with progressive resolution refinement2002
- Parallel Data Mining for Association Rules on Shared-Memory SystemsKnowledge and Information Systems, 2001
- Mining frequent patterns without candidate generation2000
- Parallel and distributed association mining: a surveyIEEE Concurrency, 1999
- Dynamic itemset counting and implication rules for market basket data1997
- A fast distributed algorithm for mining association rules1996
- Parallel mining of association rulesIEEE Transactions on Knowledge and Data Engineering, 1996
- An effective hash-based algorithm for mining association rules1995
- Mining association rules between sets of items in large databases1993