原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
r cluster S(ℓ), then for attributes a = 1, 2, …, d, we have Over all attributes, we write
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
rule—assigning each point x to one of the clusters whose center is nearest to x—yields an
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea