【24h】

Distributed Clustering Based on K-Means and CPGA

机译:基于K-Means和CPGA的分布式聚类

获取原文
获取外文期刊封面目录资料

摘要

Distributed clustering is a new research field of data mining now. In this paper, one of distributed clustering named DCBKC (Distributed Clustering Based on K-means and Coarse-grained parallel genetic algorithm) based on K-means and Coarse-grained Parallel Genetic Algorithm is advanced. The algorithm can solve local clustering problem of distributed clustering effectively, reflect all of local data characters, enhance local data’s perspectivity and decrease network overload at a way by adopting proper migration strategy simultaneously. Both theory analysis and experimental results confirm that DCBKC is feasible.
机译:分布式群集现在是数据挖掘的新研究领域。在本文中,基于K-MATION和粗粒度并行遗传算法,提出了一种名为DCBKC(基于K-MEARS和COMARS-GRANDIMING算法的分布式聚类)的分布式聚类之一。该算法可以有效地解决了分布式聚类的本地聚类问题,反映了所有本地数据字符,通过同时采用适当的迁移策略,增强本地数据的透视和减少网络过载。理论分析和实验结果都证实DCBKC是可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号