计算机应用 ›› 2005, Vol. 25 ›› Issue (09): 1989-1991.DOI: 10.3724/SP.J.1087.2005.01989

• Web与数据库 • 上一篇    下一篇

基于并行计算的关联规则挖掘优化算法

吴磊1,陈鹏2   

  1. 1.电子科技大学应用数学学院; 2.北京大学计算机科学与技术学院
  • 出版日期:2005-09-01 发布日期:2011-04-11

Updated algorithm for mining association rules based on parallel computation

WU Lei1,CHEN Peng2   

  1. 1.School of Applied Mathematics,University of Electronic Science and Technology of China,Chengdu Sichuan 610054,China;2.College of Computer Science and Technology,Peking University,Beijing 100871,China
  • Online:2005-09-01 Published:2011-04-11

摘要: 研究了采用并行算法挖掘关联规则的优化方案。在数据分发(DD)算法的基础上引入了改进的智能数据分发(IDD)算法;之后提出采用混和分发(HD)算法,该算法综合了计数分发(CD)和IDD算法的优点,简单而有效地解决了算法中非常重要的候选项目集在各个处理器节点之间的划分问题,尽可能使得各个节点负载平衡。最后,对IDD和HD算法的复杂度给出了较为详细的分析。

关键词: 关联规则, 负载平衡, 候选集, 并行算法

Abstract: Updated solution in parallel implementation of discovery of association rules was studied,and IDD algorithm based on DD algorithm was introduced.After that,HD algorithm,based on IDD and CD algorithms was proposed to solve the problem of distributing the candidate item sets among processors effectively.The last part was the complexity analysis of the IDD and HD algorithms.

Key words: associated rules, load balance, candidate sets, parallel algorithm

中图分类号: