Efficient strategies for parallel mining class association rules

doi:10.1016/j.eswa.2014.01.038

Efficient strategies for parallel mining class association rules

2014-08-01

29

PRE

AI

DOI：10.1016/j.eswa.2014.01.038

Original

Original request for help

Save

Abstract

En 中文

Mining class association rules (CARs) is an essential, but time-intensive task in Associative Classification (AC). A number of algorithms have been proposed to speed up the mining process. However, sequential algorithms are not efficient for mining CARs in large datasets while existing parallel algorithms require communication and collaboration among computing nodes which introduces the high cost of synchronization. This paper addresses these drawbacks by proposing three efficient approaches for mining CARS in large datasets relying on parallel computing. To date, this is the first study which tries to implement an algorithm for parallel mining CARs on a computer with the multi-core processor architecture. The proposed parallel algorithm is theoretically proven to be faster than existing parallel algorithms. The experimental results also show that our proposed parallel algorithm outperforms a recent sequential algorithm in mining time. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Associative classification

Class association rule mining

Parallel computing

Data mining

Multi-core processor

Efficient strategies for parallel mining class association rules

Abstract

AI Summary

Journal

Organization