知识卡片
聚类预先指定组数
K均值以给定的组数把样本分成若干簇,并用簇中心概括组内位置。组数是建模选择而非数据自动给定的真理,应结合任务检查。原书列举多种距离不表示标准均值更新可无条件套用于每种距离。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
a k value is received that represents the number of clusters. Then it classifies the data set by dividing it into a given number of clusters of similar characteristics/preferences. The similarity is calculated using the distance between the two items. In this method, the distance is measured using a square Euclidean, Manhattan, Euclidean, or Cosine distance measure. This method is evaluated using the elbow method
参考来源
- 位置:《Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications》第01章《推荐系统的机器学习方法》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications/_epub-src/OEBPS/Text/9789815136746-C1.html)
- 结论依据:摘录中关于聚类预先指定组数的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:a k value is received that represents the number of clusters. Then it classifies the data set by dividing it into a given number of clusters of similar characteristics/preferences. The similarity is calculated using the distance between the two items. In this method, the distance is measured using a square Euclidean, Manhattan, Euclidean, or Cosine distance measure. This method is evaluated using the elbow method