原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
each point to its nearest center, where In the second line, the k-clustering 〈S(1),S(2),…
,S(k)〉 is defined by the centers C and the nearest-center rule. See Exercise 33.1-1 for an alternative formulation based on pairwise interpoint distances. Is there a polynomial-time algorithm for the k-means problem? Probably not, because it is NP-hard [310].
As we’ll see in Chapter 34, NP-hard problems have no known polynomial-time algorithm, but
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea