知识卡片

普通读书笔记卡 · 3710.b.2

k聚类把样本分为互斥子集

理解等级:初级

给定样本集合S,k聚类是把它分成k个互不相交、并集为S的子集;在本书定义下,某些子集可以为空。

若样本属性相同,数学上还可能把S视为多重集。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第33章 机器学习算法 · 查看原书依据

      , S(k)〉 of k disjoint subsets, or clusters, so that S = S(1) ⋃ S(2) ⋃ ⋯ ⋃ S(k). A cluster may be empty, for example if k > 1 but all of the points in S have the same attribute values. There are many ways to define a k-clustering of S and many ways to evaluate the quality of a given k-clustering. We consider here only k-clusterings of S that are defined by a sequence C of k centers C

    参考来源

    - 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[10000,15000))。 - 结论依据:原文第33章导言和33.1节的学习任务、聚类定义、目标函数与局部最优说明;公式及图已核对。 - 原始内容:we define a k-clustering of S as a decomposition of S into a sequence 〈 S (1) , S (2) , …, S ( k ) 〉 of k disjoint subsets, or clusters , so that S = S (1) ⋃ S (2) ⋃ ⋯ ⋃ S ( k ) . A cluster may be empty, for example if k > 1 but all of the points in S have the same attribute values. There are many ways to define a k -clustering of S and many ways to evaluate the quality of a given k -clustering. We consider here only k -clusterings of S that are defined by a sequence C of k centers C