PDF Downloads:
988
Open
Access -
Khadidja Belbachir and Hafida Belbachir
Computer Sciences Department, University of Sciences and Technologies of Oran USTO, Algeria.
Article Received on :
Article Accepted on :
Article Published :
As a result of the physical storage expansion and backup equipment and the increasing need to store more data, the sequential searching algorithms of association rules have been found ineffective. Thus the introduction of new parallel versions has become a necessity. We propose in this paper, a parallel version of a sequential algorithm Partition. This is fundamentally different from other sequential algorithms, as it scans the database only twice to generate all significant association rules. Consequently, the parallel approach does not require much communication between sites. The proposed approach was implemented for an experimental study. The results obtained show a large gain in execution time compared to the sequential version.
KEYWORDS: Association rules; Distributed data mining; Partition; Parallel algorithms| Copy the following to cite this article: Belbachir K, Belbachir H. Parallel Mining Association Rules in Calculation Grids. Orient. J. Comp. Sci. and Technol;6(3) |
| Copy the following to cite this URL: Belbachir K, Belbachir H. Parallel Mining Association Rules in Calculation Grids. Orient. J. Comp. Sci. and Technol;6(3). Available from: http://www.computerscijournal.org/?p=2815 |
