A new parallel association rule mining algorithm on distributed shared memory system Online publication date: Sun, 27-Jan-2013
by Mohamed H. Marghny; Hosam E. Refaat
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 7, No. 4, 2012
Abstract: Frequent itemset finding is the most time consuming step in analysing large transactional databases. The use of sequential algorithms cannot give analytical ability for such very large databases especially in terms of run-time performance. Therefore, we must rely on high performance parallel computing. In this paper, we present a new parallel algorithm for frequent itemset mining, called 'HorVertical' algorithm. This algorithm introduces a new database partitioning called 'HorVertical' partitioning. This technique in partitioning the database reduces the dependency in the parallel computation and gives new properties to reduce the computations. The algorithm passes the database only one time and starts a new stage with the finished itemsets while some other itemsets in the same stage have not been finished yet. We present the result on the performance of our algorithm on various databases, and compare it against well known algorithms.
Online publication date: Sun, 27-Jan-2013
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com