摘要
研究了采用并行算法挖掘关联规则的优化方案。在数据分发(DD)算法的基础上引入了改进的智能数据分发(IDD)算法;之后提出采用混和分发(HD)算法,该算法综合了计数分发(CD)和IDD算法的优点,简单而有效地解决了算法中非常重要的候选项目集在各个处理器节点之间的划分问题,尽可能使得各个节点负载平衡。最后,对IDD和HD算法的复杂度给出了较为详细的分析。
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.
出处
《计算机应用》
CSCD
北大核心
2005年第9期1989-1991,共3页
journal of Computer Applications
关键词
关联规则
负载平衡
候选集
并行算法
associated rules
load balance
candidate sets
parallel algorithm
