Balanced Parallel FP-Growth with MapReduce
文献类型：会议论文
| 作者 | Le Zhou; Zhiyong Zhong; Jin Chang; Junjie Li; Joshua Zhexue Huang; Shengzhong Feng |
| 出版日期 | 2010 |
| 会议名称 | 2010 IEEE Youth Conference on Information, Computing and Telecommunications, YC-ICT 2010 |
| 英文摘要 | Frequent itemset mining (FIM) plays an essential role in mining associations, correlations and many other important data mining tasks. Unfortunately, as the volume of dataset gets larger day by day, most of the FIM algorithms in literature become ineffective due to either too huge resource requirement or too much communication cost. In this paper, we propose a balanced parallel FP-Growth algorithm BPFP, based on the PFP algorithm [1], which parallelizes FP-Growth in the MapReduce approach. BPFP adds into PFP load balance feature, which improves parallelization and thereby improves performance. Through empirical study, BPFP outperformed the PFP which uses some simple grouping strategy |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3119]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2010 |
| 推荐引用方式 GB/T 7714 | Le Zhou,Zhiyong Zhong,Jin Chang,et al. Balanced Parallel FP-Growth with MapReduce[C]. 见:2010 IEEE Youth Conference on Information, Computing and Telecommunications, YC-ICT 2010. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。