| 一种基于Hadoop的并行关联规则算法 |
| |
| 引用本文： | 余楚礼,肖迎元,尹波.一种基于Hadoop的并行关联规则算法[J].天津理工大学学报,2011,27(1):25-28,32. |
| |
| 作者姓名： | 余楚礼 肖迎元 尹波 |
| |
| 作者单位： | 1. 天津理工大学计算机与通信工程学院,天津,300384
2. 21世纪恒丰环保节能工程有限公司,天津,300384 |
| |
| 基金项目： | 国家863基金，天津市自然科学基金，中小企业创新基金 |
| |
| 摘 要： | 在挖掘大型数据库的关联规则时,使用并行计算是必需的.针对传统的并行计算,存在不能处理节点失效,难以处理负载均衡等问题,提出基于Hadoop架构实现并行关联规则计算的设计.理论和实验证明,基于Hadoop的并行关联规则计算,能处理节点失效,并且能做到节点负载均衡.
|
| 关 键 词： | 关联规则 Hadoop 云计算 数据挖掘 |
A parallel algorithm for mining frequent item sets on Hadoop |
| |
| YU Chu-li,XIAO Ying-yuan,YIN Bo.A parallel algorithm for mining frequent item sets on Hadoop[J].Journal of Tianjin University of Technology,2011,27(1):25-28,32. |
| |
| Authors: | YU Chu-li XIAO Ying-yuan YIN Bo |
| |
| Institution: | YU Chu-li1,XIAO Ying-yuan1,YIN Bo2 (1.School of Computer and Communications Engineering,Tianjin University of Technology,Tianjin 300384,China,2.21st Centruy Hengfeng Environmental Conservtion Engineering Co.,Ltd,China) |
| |
| Abstract: | Parallel compute is required in mining frequent item sets on large databases.MPI can't handle node failure,and it's difficult to solve load balance.So we propose parallel mining frequent item sets on Hadoop.Theoretical and experimental results show parallel mining frequent item sets on Hadoop can handle node failure and can solve load balance. |
| |
| Keywords: | Hadoop |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
