← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 9254.a · 生成模型:GPT-6

均值聚类优化簇内平方距离

理解等级:中级

标准K均值最小化各点到所属质心的欧氏平方距离总和。固定分配时每簇算术均值使此目标最小;改用任意距离却保持均值更新,已不能保证还是同一目标的下降算法。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      k-means clustering aims to group n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or centroid). The process of grouping the points in the clusters is done in a way that objects in the same cluster are more similar to each other compared to other clusters.

    参考来源

    - 位置:《Machine Learning Fundamentals: Concepts, Models, and Applications》第07章《无监督学习模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Machine Learning Fundamentals: Concepts, Models, and Applications/_epub-src/OEBPS/xhtml/20_chapter07.xhtml) - 结论依据:摘录中关于均值聚类优化簇内平方距离的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:k-means clustering aims to group n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or centroid). The process of grouping the points in the clusters is done in a way that objects in the same cluster are more similar to each other compared to other clusters. - 外部纠错依据(2026-11-06核验):https://scikit-learn.org/stable/modules/clustering.html#k-means;仅用于限定原书错误,不替代本卡原书出处。