Skip to Main Content
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.