知识卡片

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

质心唯一最小化组内平方距离

理解等级:高级

固定一个非空聚类时,每个坐标上的组内平方误差都是关于中心坐标的严格凸二次函数;令导数为零,中心该坐标等于组内均值。因此整组质心是唯一的平方误差最小中心。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      Theorem 33.1 Given a nonempty cluster S(ℓ), its centroid (or mean) is the unique choice for the cluster center c(ℓ) ∈ ℝd that minimizes Proof We wish to minimize, by choosing c(ℓ) ∈ ℝd, the sum For each attribute a, the term summed is a convex quadratic function in . To minimize this function, take its derivative with respect to and set it to 0: or, equivalently, Since the minimum is obtained uniquely when each coordinate of is the average of the corresponding coordinate for x ∈ S(ℓ), the overall minimum is obtained when c(ℓ) is the centroid of the points x, as in equation (33.3). ▪ Optimal clusters for given centers The following theorem shows that the nearest-center

    参考来源

    - 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[15000,20000))。 - 结论依据:原文第33.1–33.2节质心和分配定理、劳埃德过程、假设优化框架、色彩量化示例或专家预测引理。 - 原始内容:Theorem 33.1 Given a nonempty cluster S (ℓ) , its centroid (or mean) is the unique choice for the cluster center c (ℓ) ∈ ℝ d that minimizes Proof We wish to minimize, by choosing c (ℓ) ∈ ℝ d , the sum For each attribute a , the term summed is a convex quadratic function in . To minimize this function, take its derivative with respect to and set it to 0: or, equivalently, Since the minimum is obtained uniquely when each coordinate of is the average of the corresponding coordinate for x ∈ S (ℓ) , the overall minimum is obtained when c (ℓ) is the centroid of the points x , as in equation (33.3). ▪ Optimal clusters for given centers The following theorem shows that the nearest-center