返回主题:经典算法与业务建模

知识卡片

普通读书笔记卡 · 3710.b.2.b.1.c

劳埃德交替分配与更新中心

理解等级:中级

劳埃德过程

  1. 先按最近中心分组,
  2. 再把每组中心更新为该组质心,
  3. 反复执行直至分组不再变化。

若出现空组,书中约定中心取零向量;并列距离不随意改组。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第33章 机器学习算法 · 查看原书依据

      , S(k)〉. That is, assign each point x ∈ S to a cluster S(ℓ) having a nearest center (breaking ties arbitrarily, but not changing the assignment for a point x unless the new cluster center is strictly closer to x than the old one). Stop if no change: If step 2 did not change the assignments of any points to clusters, then stop and return the clustering 〈S(1), S(2),

    参考来源

    - 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[15000,20000))。 - 结论依据:原文第33.1–33.2节质心和分配定理、劳埃德过程、假设优化框架、色彩量化示例或专家预测引理。 - 原始内容:Assign points to clusters: Use the nearest-center rule to define the clustering 〈 S (1) , S (2) , …, S ( k ) 〉 . That is, assign each point x ∈ S to a cluster S (ℓ) having a nearest center (breaking ties arbitrarily, but not changing the assignment for a point x unless the new cluster center is strictly closer to x than the old one). Stop if no change: If step 2 did not change the assignments of any points to clusters, then stop and return the clustering 〈 S (1) , S (2) , …, S ( k ) 〉 and the associated centers 〈 c (1) , c (2) , …, c ( k ) 〉 . Otherwise, go to step 4. Recompute centers as centroids: For ℓ = 1, 2, …, k , compute the center c (ℓ) of cluster S (ℓ) as the centroid of the points in S (ℓ) . (If S (ℓ) is empty, let c (ℓ) be the zero vector.) Then go to step 2.