ABSTRACT:

In the project , we revised Apriori implementation into a parallel one where input transactions are read by a parallel computer. The effect of a parallel computer on this modified implementation is presented. The main objective is to find the Frequent item sets. We use Apriori Algorithm to find the frequent item sets.

The results of Apriori implementation for finding frequent item sets (FIM) appear to be faster than Borgelt and Goethals.

Software Requirements:

-Java

-Swings

Hardware Requirements:

PC configuration:

-Processor – Pentium IV Processor, 2.6 GHz

-RAM - 512 mb