原书出处
Machine Learning Fundamentals: Concepts, Models, and Applications
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