基于MapReduce的Canopy-Kmeans.pdfVIP

  • 113
  • 0
  • 约2.77万字
  • 约 6页
  • 2017-09-15 发布于重庆
  • 举报
22 2012 ,48 (27 ) Computer Engineering and Applications 计算机工程与应用 基于MapReduce 的Canopy-Kmeans 改进算法 毛典辉 MAO Dianhui 北京工商大学 计算机与信息工程学院,北京 100048 School of Computer and Information Engineering, Beijing Technology and Business University, Beijing 100048, China MAO Dianhui. Improved Canopy-Kmeans algorithm based on MapReduce. Computer Engineering and Ap- plications, 2012, 48 (27 ):22-26. Abstract :In order to solve the problem that how to void random Canopy selection of Canopy-Kmeans algorithm, this paper introduces an improved algorithm based on the minimum and maximum principle and

文档评论(0)

1亿VIP精品文档

相关文档