Probabilistic frequent itemset mining on a GPU cluster

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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, and the methods on a GPU cluster of eight nodes achieve up to a 7.1 times speedup. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Kozawa, Y., Amagasa, T., & Kitagawa, H. (2014). Probabilistic frequent itemset mining on a GPU cluster. In IEICE Transactions on Information and Systems (Vol. E97-D, pp. 779–789). Institute of Electronics, Information and Communication, Engineers, IEICE. https://doi.org/10.1587/transinf.E97.D.779

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free