机器学习笔记 ---- K-Means Algorithm

1. K-Means Algorithm

  • Randomly choose x x x points as centroids, i-th is μ i \mu_i μi
  • Divide all points into x x x groups by determining the minimum distance they have from all x x x centroids
  • Change the centroids into the average of each groups
  • Repeat until all centroids do not change

2. Obtimization Objective of K-Means

Let c ( i ) c_{(i)} c(i) denote the group i-th point belongs to, then our task is

m i n c , μ J ( c , μ ) = ∑ ( x ( i ) − μ c ( i ) ) 2 min_{c,\mu} \quad J(c,\mu)=\sum (x^{(i)}-\mu_{c_{(i)}})^2 minc,μJ(c,μ)=(x(i)μc(i))2

3. Random Initialization

Randomly pick k k k examples in which k k k is the number of centroids
May be stuck in local optima: Init and Run K-Means for many times, pick the solution with lowest J J J

4. Choose the Number of Clusters

Elbow method / Depending on later purpose

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值