← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

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

is that each data point x should be grouped with a cluster having a center closest to x.)

Second, define a measure f(E, θ) describing how poorly hypothesis hθ fits the given training data E. Smaller values of f(E, θ) are better, and a (locally) optimal solution (locally) minimizes f(E, θ). (For the k-means problem, f(E, θ) is just f(S, C).) Third, given a set of training data E, use a suitable optimization procedure to find a value of θ* that minimizes f(E, θ*), at least locally. (For the k-means problem, this value of θ* is the sequence C of k center points returned by Lloyd’s algorithm.) Return θ* as the answer. In this framework, we see that optimization becomes a

powerful tool for machine learning. Using optimization in this way is flexible. For examp

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea