PMCR-Miner: Parallel maximal confident association rules miner algorithm for microarray data set
Zakaria, Wael;
Abstract
Copyright © 2015 Inderscience Enterprises Ltd. The MCR-Miner algorithm is aimed to mine all maximal high confident association rules form the microarray up/down-expressed genes data set. This paper introduces two new algorithms: IMCR-Miner and PMCR-Miner. The IMCR-Miner algorithm is an extension of the MCR-Miner algorithm with some improvements. These improvements implement a novel way to store the samples of each gene into a list of unsigned integers in order to benefit using the bitwise operations. In addition, the IMCR-Miner algorithm overcomes the drawbacks faced by the MCR-Miner algorithm by setting some restrictions to ignore repeated comparisons. The PMCR-Miner algorithm is a parallel version of the new proposed IMCR-Miner algorithm. The PMCR-Miner algorithm is based on shared-memory systems and task parallelism, where no time is needed in the process of sharing and combining data between processors. The experimental results on real microarray data sets show that the PMCR-Miner algorithm is more efficient and scalable than the counterparts.
Other data
Title | PMCR-Miner: Parallel maximal confident association rules miner algorithm for microarray data set | Authors | Zakaria, Wael | Issue Date | 1-Jan-2015 | Publisher | INDERSCIENCE ENTERPRISES LTD | Journal | International Journal of Data Mining and Bioinformatics | DOI | 3 225 https://api.elsevier.com/content/abstract/scopus_id/84943428513 13 10.1504/IJDMB.2015.072091 |
PubMed ID | 13 | Scopus ID | 2-s2.0-84943428513 | Web of science ID | WOS:000364232000002 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.