清华云计算课件分布式集群.pptVIP

  • 0
  • 0
  • 约3.91千字
  • 约 54页
  • 2019-05-19 发布于湖北
  • 举报
* * * * Assigning Points to Canopies K-Means Map Iterating K-Means Elbow Criterion Choose a number of clusters s.t. adding a cluster doesn’t add interesting information. Rule of thumb to determine what number of Clusters should be chosen. Initial assignment of cluster seeds has bearing on final model performance. Often required to run clustering several times to get maximal performance Conclusions Clustering is slick And it can be done super efficiently And in lots of different ways * * * * * * * * Distributed Computing Seminar Lecture 4: Clustering – an Overview and Sample MapReduce Impl

文档评论(0)

1亿VIP精品文档

相关文档