Advanced Partition Approach for Frequent Patterns Discovery

The discovery of association rules is the most well studied problem in data mining. It has received much attention among the various data mining problems. Many algorithms have been proposed for this purpose. In this paper an efficient algorithm for mining association rules has been proposed which is fundamentally different from known algorithms. Compared to previous algorithms this algorithm reduces the database scans thereby lowering the CPU overhead in most cases. We have performed extensive experiments and compared the performance of this algorithm with that of the best existing algorithm. It was found that the database scans are reduced in the proposed algorithm.