知识卡片
近邻预测依赖距离设计
近邻方法先按选定特征与距离找到接近的已知样本,再据邻居推断目标。距离反映什么相似性,需要与任务和数据表示一致;训练阶段简便并不代表在线比较大量样本没有开销。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
It finds similar items based on the distance between test data and individual training data using a variety of distance concepts. In this algorithm, predictions are mainly made using the calculation of the Euclidean distance of the nearest neighbors. Besides, the use of Jaccard similarity, Minkowski, Manhattan, or Hamming distance can be done instead of Euclidean. This is a non-parametric algorithm that assumes nothing about
参考来源
- 位置:《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)
- 结论依据:摘录中关于近邻预测依赖距离设计的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:It finds similar items based on the distance between test data and individual training data using a variety of distance concepts. In this algorithm, predictions are mainly made using the calculation of the Euclidean distance of the nearest neighbors. Besides, the use of Jaccard similarity, Minkowski, Manhattan, or Hamming distance can be done instead of Euclidean. This is a non-parametric algorithm that assumes nothing about