← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

33 第33章 机器学习算法

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

specified by a d-dimensional feature vector x = (x1, x2, …, xd). Here, xa for a = 1, 2, …

, d is a real number giving the value of attribute a for example x. We call x the point in ℝd representing the example. For the example in Figure 33.1, each capital x has its latitude in x1 and its longitude in x2. In order to cluster similar points together, we need to define similarity. Instead, let’s define the opposite:

the dissimilarity Δ(x, y) of points x and y is the squared Euclidean distance between the

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea