Maximizing the Efficiency of Parallel Apriori Algorithm

被引：4

作者：

Shah, Ketan D. ^{[1
]}

Mahajan, Sunita ^{[2
]}

机构：

[1] SVKMs NMIMS Univ, Dept Informat Technol, MPSTME, Mumbai, Maharashtra, India

[2] MET, Inst Comp Sci, Bombay, Maharashtra, India

来源：

2009 INTERNATIONAL CONFERENCE ON ADVANCES IN RECENT TECHNOLOGIES IN COMMUNICATION AND COMPUTING (ARTCOM 2009) | 2009年

关键词：

Data Mining; Association Rules; Parallel Mining; Apriori Algorithm; Frequent Item-set Generation; Load Balancing;

D O I：

10.1109/ARTCom.2009.73

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper we attempt to maximize the efficiency of the parallel Apriori Algorithm. The paper analyzes the performance of the algorithm over different datasets and over n processors on a commodity cluster of machines. In the Apriori Algorithm all processes need to synchronize after every pass. If any process is assigned more load than other processes in the system, the slowest process will dictate the speed of the program. It is therefore important to ensure that load is equally balanced among all processes. Our algorithm determines the no. of running processes and divides the load equally so as to maximize the system performance and its efficiency. The experiments conducted show that the parallel algorithm scales well to the number of processes and also improves on the efficiency by effective load balancing.

引用

页码：107 / +

页数：2