原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
cedure many times with different randomly chosen initial centers, taking the best result.
The running time of Lloyd’s procedure is proportional to the number T of iterations. In one iteration, assigning points to clusters based on the nearest-center rule requires O(dkn) time, and recomputing new centers for each cluster requires O(dn) time (because each point is in one cluster). The overall running time of the k-means
procedure is thus O(Tdkn). Lloyd’s algorithm illustrates an approach common to many machi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea