Mining association rules from large databases is very costly. We propose to develop parallel algorithms for this task on shared-memorymultiprocessor (SMP). All proposed parallel algorithms for other paradigms follow ...
详细信息
Mining association rules from large databases is very costly. We propose to develop parallel algorithms for this task on shared-memorymultiprocessor (SMP). All proposed parallel algorithms for other paradigms follow the conventional level-wise approach: they need as many iterations as the length of the maximum large itemset. To make matter worse, they impose a synchronization in every iteration which would cause serious I/O contention on shared-memory parallel system. An adaptive asynchronous parallel mining algorithm APM has been proposed for SMP. All processors generate candidates dynamically and count itemset supports independently without synchronization. Two optimization techniques have been proposed for the reduction of database scanning and the number of candidates. The algorithm APM has been implemented on a Sun Enterprise 4000 shared-memorymultiprocessor with 12 nodes. The experiments show that the optimizations have very good effects and APM has a substantial lead in performance over other proposed level-wise algorithms.
暂无评论