原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
ters, we define a k-clustering of S as a decomposition of S into a sequence 〈S(1), S(2), …
, S(k)〉 of k disjoint subsets, or clusters, so that S = S(1) ⋃ S(2) ⋃ ⋯ ⋃ S(k). A cluster may be empty, for example if k > 1 but all of the points in S have the same attribute values. There are many ways to define a k-clustering of S and many ways to evaluate the quality of a given k-clustering. We consider here only k-clusterings of S that are defined by a sequence C of k centers C
= 〈c(1), c(2), …, c(k)〉, where each center is a point in ℝd, and the nearest-center rule
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea