← 返回卡片

原书出处

Machine Learning Fundamentals: Concepts, Models, and Applications

First edition · 核验版本的摘录快照 · 导入于 2026-11-14T17:39:01.613Z

In K-means, we take each point belonging to a given data set and associate it to the nearest centroid. When all points are assigned, the first step is completed, and the initial grouping is done. Next, we recalculate k new centroids as centers of the clusters resulting from the previous step. Once we have the new centroids, a new grouping is to be made between

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

原书定位详情

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

正文位置:extracted/Machine Learning Fundamentals: Concepts, Models, and Applications/_epub-src/OEBPS/xhtml/20_chapter07.xhtml

EPUB SHA-256:cd5888fc4b08a1424ddc108808de40630455d9f7e3f562ef4ee7cc2b70acad2a