返回主题:经典算法与业务建模

知识卡片

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

最近中心归属须稳定处理并列

理解等级:中级

以k个中心定义聚类时,样本归于距离最近的中心;中心可在样本集之外。

距离并列须保证每个样本只属于一组,且已有最近中心时不要仅因并列就换组,避免无收益的反复迁移。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      the nearest-center rule says that a point x may belong to cluster S(ℓ) if the center of no other cluster is closer to x than the center c(ℓ) of S(ℓ): x ∈ S(ℓ) only if Δ(x, c(ℓ)) = min {Δ(x, c(j)): 1 ≤ j ≤ k}. A center can be anywhere, and not necessarily a point in S. Ties are possible and must be broken so that each point lies in exactly one cluster. In general, ties may be broken arbitrarily, although we’ll need the property that we never change which cluster a point x is assigned to unless the distance from x to its new cluster center is strictly smaller than the distance from x to its old cluster center. That is, if the current cluster has a center that is one of the closest cluster centers to x, then don’t change which cluster x is assigned to. The k-means problem is then the following: given a set S of n points

    参考来源

    - 位置:《算法导论(第4版)》第33章《机器学习算法》(OEBPS/chapter033.xhtml,文本字符[10000,15000))。 - 结论依据:原文第33章导言和33.1节的学习任务、聚类定义、目标函数与局部最优说明;公式及图已核对。 - 原始内容:the nearest-center rule says that a point x may belong to cluster S (ℓ) if the center of no other cluster is closer to x than the center c (ℓ) of S (ℓ) : x ∈ S (ℓ) only if Δ( x , c (ℓ) ) = min {Δ( x , c ( j ) ): 1 ≤ j ≤ k }. A center can be anywhere, and not necessarily a point in S . Ties are possible and must be broken so that each point lies in exactly one cluster. In general, ties may be broken arbitrarily, although we’ll need the property that we never change which cluster a point x is assigned to unless the distance from x to its new cluster center is strictly smaller than the distance from x to its old cluster center. That is, if the current cluster has a center that is one of the closest cluster centers to x , then don’t change which cluster x is assigned to. The k-means problem is then the following: given a set S of n points