The key problem in distributed association rules mining is to cluster partition in distributed environment.
在分布式关联规则挖掘中,首先需要解决分布式环境下的聚类分区问题。
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.
在分布式关联规则挖掘中首先需要解决分布式环境下的聚类分区问题,该文基于CURE的工作原理,提出了D - CURE算法。
In order to raise the level of protection of data privacy and accuracy of the outcome of the excavation, an effective protection of the privacy of distributed algorithms Mining Association Rules Act.
为了提高对隐私数据的保护程度和挖掘结果的准确性,提出一种有效的隐私保护分布式关联规则挖掘算法。
应用推荐