Probabilistic frequent itemset mining, which discovers frequent itemsets from uncertain data, has attracted much attention due to inherent uncertainty in the real world. Many algorithms have been proposed to tackle this problem, but their performance is not satisfactory because handling uncertainty incurs high processing cost. To accelerate such computation, we utilize GPUs (Graphics Processing Units). Our previous work accelerated an existing algorithm with a single GPU. In this paper, we extend the work to employ multiple GPUs. Proposed methods minimize the amount of data that need to be communicated among GPUs, and achieve load balancing as well. Based on the methods, we also present algorithms on a GPU cluster. Experiments show that the single-node methods realize near-linear speedups. © 2013 Springer-Verlag.
CITATION STYLE
Kozawa, Y., Amagasa, T., & Kitagawa, H. (2013). Parallel and distributed mining of probabilistic frequent itemsets using multiple GPUs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8055 LNCS, pp. 145–152). https://doi.org/10.1007/978-3-642-40285-2_14
Mendeley helps you to discover research relevant for your work.