摘要： 介绍了一种改进的基于Apriori算法的挖掘关联规则的并行算法,并和以前提出的DD算法进行了比较。这种改进的算法克服了以IDD前提出的DD算法的缺点,消除了DD算法中的工作冗余。
关键词:
数据挖掘,
并行处理,
关联规则,
负载平衡
Abstract: In this paper we introduce an improved algorithm about parallel data mining for association rules based on Apriori, and compare it with the DD algorithm. The improved algorithm IDD solves the problems of the DD algorithm, and eliminates the redundant work inherent in DD. ;;;
中图分类号:
颜雪松,蔡之华. 一种改进的挖掘关联规则的并行算法研究[J]. , 2002, 28(06): 112-115.
YAN Xuesong, CAI Zhihua. Research on an Improved Parallel Algorithm of Mining Association Rules[J]. , 2002, 28(06): 112-115.