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算法。
From this benchmark, we can conclude that the best way to take maximum benefit from this kind of cluster is to partition our job or application.
通过这一基准，我们可以得出这样的结论：要最大限度地受益于此类集群，最好的方法就是划分作业或者应用程序。
应用推荐