By Topic

A parallel algorithm for mining association rules

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

2 Author(s)
Junrui Yang ; Dept. of Comput. Sci., Xi''an Univ. of Sci. & Tech., Xi''an, China ; Yashuang Yang

There are disadvantages of producing vast candidate items set and correspondence in the traditional parallel algorithms for mining association rules. One comparative efficient parallel algorithm for mining association rules PBFI-Miner is presented. It uses the bit objects to express data and to improve the FP-Tree; and uses parting strategy to achieve near optimal balancing between processors. The processors communicate with bit object groups so that the algorithm efficiency is increased. Experimental result verifies the efficiency of the PBFI-Miner.

Published in:

Networking and Digital Society (ICNDS), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

30-31 May 2010