By Topic

A parallel algorithm for frequent itemset mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li Li ; Sch. of Comput. & Commun. Eng., Southwest Jiaotong Univ., Chengdu, China ; Donghai Zhai ; Fan Jin

Frequent itemsets mining plays an essential role in data mining. A new algorithm PFP-growth (parallel FP-growth), which is based on the improved FP-growth, is proposed for parallel frequent itemset mining. The new algorithm distributes the task fairly among the parallel processors. We devise partitioning strategies at different stages of the mining process to achieve balance between processors and adopt some data structure to reduce the information transportation between processors. The experiments on national high performance parallel computer show that the PFP-growth is an efficient parallel algorithm for mining frequent itemset.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003