Abstract:
The key problem in distributed association rules mining is to cluster partition in distributed environment. This paper presents an algorithm called D-CURE which is based on the principle of CURE. The performance shows that D-CURE algorithm can effectively resolve the clustering partition problem in distributed environment.
摘要： 在分布式关联规则挖掘中，首先需要解决分布式环境下的聚类分区问题。该文基于CURE的工作原理，提出了D-CURE算法。实验证明，D-CURE算法可以很好地解决在分布式环境下的聚类分区问题。
关键词:
关联规则,
数据挖掘,
聚类
CLC Number:
REN Jiadong,HE Haitao,REN Dongying. Clustering Partition Algorithm for Distributed Association Rules Mining[J]. , 2003, 29(17): 31-33.
任家东,何海涛,任东英. 分布式关联规则挖掘中的聚类分区算法[J]. , 2003, 29(17): 31-33.