知识卡片
剪枝选择应使用验证证据
剪枝减少分支并权衡拟合与复杂度,通常依据训练内部的交叉验证或独立验证选择。若反复用最终测试决定删哪条枝,测试已参与选择,不能再称最终独立评估。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 监督学习模型
原书出处 · 1 处
- · 查看原书依据
Tree pruning: decision tree’s complexity is defined as the number of splits in the tree. Trees with fewer branches are recommended as they are simple to grasp and less prone to cluster the data. Working through each leaf node in the tree and evaluating the effect of deleting it using a hold-out test set is the quickest and simplest pruning approach.
参考来源
- 位置:《Machine Learning Fundamentals: Concepts, Models, and Applications》第06章《监督学习模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Machine Learning Fundamentals: Concepts, Models, and Applications/_epub-src/OEBPS/xhtml/19_chapter06.xhtml)
- 结论依据:摘录中关于剪枝选择应使用验证证据的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Tree pruning: decision tree’s complexity is defined as the number of splits in the tree. Trees with fewer branches are recommended as they are simple to grasp and less prone to cluster the data. Working through each leaf node in the tree and evaluating the effect of deleting it using a hold-out test set is the quickest and simplest pruning approach.