Kmeans Clustering University of Albertak均值集群艾伯塔大学.pptVIP

  • 5
  • 0
  • 约3.23千字
  • 约 13页
  • 2017-03-07 发布于上海
  • 举报

Kmeans Clustering University of Albertak均值集群艾伯塔大学.ppt

Kmeans Clustering University of Albertak均值集群艾伯塔大学

K-Means Clustering CMPUT 615 Applications of Machine Learning in Image Analysis K-means Overview A clustering algorithm An approximation to an NP-hard combinatorial optimization problem It is unsupervised “K” stands for number of clusters, it is a user input to the algorithm From a set of data points or observations (all numerical), K-means attempts to classify them into K clusters The algorithm is iterative in nature K-means Details X1,…, XN are data points or vectors or observations Each observation will be assigned to one and only one cluster C(i) denotes cluster number for the ith observ

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档