互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

一种有效的并行频繁项集挖掘算法


□ 王丹阳 田卫东 胡学钢

   (合肥工业大学 计算机与信息学院, 合肥 230009)

  

  摘要:传统的挖掘频繁项集的并行算法存在各节点间负载不均衡、同步开销过大、通信量大等问题。针对这些问题,提出了一种多次传送重新分配数据的并行算法(MRPD)。MRPD算法在第l步时将数据库重新划分成若干组,并根据各节点的需要多次传送分组;各节点获得完整分组后异步地计算频繁项集;所有节点计算完成后,得到全部频繁项集。理论分析和实验结果表明MRPD算法是有效的。

  关键词:数据挖掘; 并行算法; 频繁项集

  中图分类号:TP182;TP301.6文献标志码:A

  文章编号:1001-3695(2008)11-3332-03

  

  Effective parallel algorithm for mining frequent itemsets

  

  WANG Dan-yang, TIAN Wei-dong, HU Xue-gang

  

  (School of Computer & Information, Hefei University of Technology, Hefei 230009, China)

  

  Abstract:There were problems in traditional parallel algorithms for mining frequent itemsets, such as load imbalance, frequent synchronization, large scale communication and so on. Aiming at solving these problems, this paper proposed a parallel algorithm with multi-transmitting redistributed data (MRPD). In MRPD, data was redistributed into some groups at step l, and all the groups were multi-transmitted according to the request of computer nodes. Each node would compute frequent itemsets asynchronously after having received one full group. Finally, resulted the integrated frequent itemsets. Theoretical analysis and experimental results suggest that MRPD is effective.

......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017