← 返回刚才阅读的位置

知识卡片

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

肘部选簇是启发式证据

理解等级:中级

对多个K计算簇内平方和并观察边际改善减缓,可提供候选簇数。曲线可能没有清晰拐点或存在多个拐点,不能把1到10视为固定范围,也不把单张示意图当最优簇数证明。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      How to Choose the Value of K Number of Clusters in K-means Clustering? The performance of the K-means clustering algorithm depends on forming highly efficient clusters. Selecting the optimal number of clusters is a big task. There are different ways of finding the optimal number of clusters, K. One widely used method is known as the elbow method described below. Elbow Method The elbow method

    参考来源

    - 位置:《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) - 结论依据:摘录中关于肘部选簇是启发式证据的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:How to Choose the Value of K Number of Clusters in K-means Clustering? The performance of the K-means clustering algorithm depends on forming highly efficient clusters. Selecting the optimal number of clusters is a big task. There are different ways of finding the optimal number of clusters, K. One widely used method is known as the elbow method described below. Elbow Method The elbow method