Parallel Mining Association Rules in Calculation Grids

摘要

As a result of the physical storage expansion and backup equipment and the increasingneed to store more data, the sequential searching algorithms of association rules have been foundineffective. Thus the introduction of new parallel versions has become a necessity. We propose inthis paper, a parallel version of a sequential algorithm Partition. This is fundamentally different fromother sequential algorithms, as it scans the database only twice to generate all significant associationrules. Consequently, the parallel approach does not require much communication between sites.The proposed approach was implemented for an experimental study. The results obtained showa large gain in execution time compared to the sequential version