| 注册
首页|期刊导航|计算机工程|基于负载均衡的并行FP-Growth算法

基于负载均衡的并行FP-Growth算法

高权 万晓冬

计算机工程2019,Vol.45Issue(3):32-35,40,5.
计算机工程2019,Vol.45Issue(3):32-35,40,5.DOI:10.19678/j.issn.1000-3428.0049606

基于负载均衡的并行FP-Growth算法

Parallel FP-Growth Algorithm Based on Load Balance

高权 1万晓冬1

作者信息

  • 1. 南京航空航天大学 自动化学院,南京 211106
  • 折叠

摘要

Abstract

Aiming at the problem that the lookup operation of FP-Growth algorithm has a high time complexity, this paper proposes a new algorithm named LBPFP.The algorithm is based on PFP algorithm, which is added a hash table to the head table to achieve fast access to item and is designed a workload model based on the prefix length to optimize the parallel process and improve the efficiency of the algorithm.The comparison experiments in the webdocs.dat database show that the LBPFP algorithm has better performance than the PFP, HPFP and DPFP algorithms.

关键词

Spark平台/频繁模式增长/并行/负载均衡/链头表/计算量模型

Key words

Spark platform/FP-Growth/parallel/load balance/head table/workload model

分类

信息技术与安全科学

引用本文复制引用

高权,万晓冬..基于负载均衡的并行FP-Growth算法[J].计算机工程,2019,45(3):32-35,40,5.

基金项目

国家部委基金. ()

计算机工程

OA北大核心CSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文