← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

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

equence C of k centers C = 〈c(1), c(2), …, c(k)〉, where each center is a point in ℝd, and

the nearest-center rule says that a point x may belong to cluster S(ℓ) if the center of no other cluster is closer to x than the center c(ℓ) of S(ℓ): x ∈ S(ℓ) only if Δ(x, c(ℓ)) = min {Δ(x, c(j)): 1 ≤ j ≤ k}. A center can be anywhere, and not necessarily a point in S. Ties are possible and must be broken so that each point lies in exactly one cluster. In general, ties may be broken arbitrarily, although we’ll need the property that we never change which cluster a point x is assigned to unless the distance from x to its new cluster center is strictly smaller than the distance from x to its old cluster center. That is, if the current cluster has a center that is one of the closest cluster centers to x, then don’t change which cluster x is assigned to. The k-means problem is then the following: given a set S of n points

and a positive integer k, find a sequence C = 〈c(1), c(2), …, c(k)〉 of k center points mi

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea