← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

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

nobody has ever proven that polynomial-time algorithms for NP-hard problems cannot exist.

Although we know of no polynomial-time algorithm that finds the global minimum over all clusterings (according to equation (33.2)), we can find a local minimum. Lloyd [304] proposed a simple procedure that finds a sequence C of k centers that yields a local minimum of f(S, C). A local minimum in the k-means problem satisfies two simple properties: each cluster has an optimal center (defined below), and each point is assigned to the cluster (or one of the clusters) with the closest center. Lloyd’s procedure finds a good clustering—possibly optimal—that satisfies these two properties. These properties are necessary, but not sufficient, for optimality. Optimal center for a given cluster In an optimal solution to the k-means problem, each center

point must be the centroid, or mean, of the points in its cluster. The centroid is a d-di

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea