← 返回卡片

原书出处

Machine Learning Fundamentals: Concepts, Models, and Applications

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

K-means is a partition-based clustering technique that uses Euclidean distances between the points as a criterion for the formation of clusters. K-means groups n number of data points into a predetermined k number of clusters. A center is allocated to each cluster and each cluster is placed at farthest distance. The incoming data point is placed in a cluster with the closest cluster center. This

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

原书定位详情

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

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

EPUB SHA-256:cd5888fc4b08a1424ddc108808de40630455d9f7e3f562ef4ee7cc2b70acad2a