← 返回起始笔记位置

知识卡片

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

近邻预测依赖距离与局部假设

理解等级:中级

KNN保存训练样本,按指定距离选k个邻居,再投票或聚合数值。非参数不等于无假设,特征尺度、距离定义与局部相似性都影响结果;高维和大量训练数据也会增加查询成本。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      The K-NN algorithm is a nonparametric supervised learning algorithm. It is a popular ML technique used for classification and regression tasks but mainly for classification. The K in KNN is a parameter that determines the number of nearest neighbors to include in the process. It is considered a nonparametric method because it does not make any assumptions about the distribution of underlying data. The KNN

    参考来源

    - 位置:《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) - 结论依据:摘录中关于近邻预测依赖距离与局部假设的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:The K-NN algorithm is a nonparametric supervised learning algorithm. It is a popular ML technique used for classification and regression tasks but mainly for classification. The K in KNN is a parameter that determines the number of nearest neighbors to include in the process. It is considered a nonparametric method because it does not make any assumptions about the distribution of underlying data. The KNN