← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.772Z

gn 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. Recom

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea