Name
Abstract | ||
|---|---|---|
This paper proposes and implements a parallel scheme of FP-growth algorithm and implements this parallel algorithm (PFP-growth algorithm). Experimental results show that, compared with FP-growth algorithm, PFP-growth algorithm is more efficient, and the larger the data set is, the lower the support threshold is, the more remarkable the speedup is. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ICEBE.2017.24 | 2017 IEEE 14th International Conference on e-Business Engineering (ICEBE) |
Keywords | Field | DocType |
frequent itemset mining,FP-growth,GPU,parallel computing | Computer science,Parallel algorithm,Algorithm,Speedup | Conference |
ISBN | Citations | PageRank |
978-1-5386-1413-6 | 0 | 0.34 |
References | Authors | |
6 | 2 | |