原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
of n points and a sequence 〈c(1), c(2), …, c(k)〉 of k centers, a clustering 〈S(1), S(2), …
, S(k)〉 minimizes if and only if it assigns each point x ∈ S to a cluster S(ℓ) that minimizes Δ(x, c(ℓ)). Proof The proof is straightforward: each point x ∈ S contributes exactly once to the sum (33.4), and choosing to put x in a cluster whose center is nearest minimizes the contribution from x. ▪
Lloyd’s procedure Lloyd’s procedure just iterates two operations—assigning points to clus
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea