知识卡片

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

硬聚类分配一个组不代表真实标签

理解等级:中级

硬聚类让每个样本只分到一个簇,划分由数据表示和算法目标产生,不是已有监督类别的恢复保证。即使输出整数编号,也不能直接把编号当用户性质或业务等级。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Exclusive clustering is a form of grouping that stipulates a data point can exist only in one cluster. This can also be referred to as hard clustering. The K-means clustering algorithm is an example of exclusive clustering.

    参考来源

    - 位置:《Machine Learning Fundamentals: Concepts, Models, and Applications》第02章《机器学习基础》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Machine Learning Fundamentals: Concepts, Models, and Applications/_epub-src/OEBPS/xhtml/13_chapter02.xhtml) - 结论依据:摘录中关于硬聚类分配一个组不代表真实标签的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Exclusive clustering is a form of grouping that stipulates a data point can exist only in one cluster. This can also be referred to as hard clustering. The K-means clustering algorithm is an example of exclusive clustering.