知识卡片

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

树按分裂准则递归划分样本

理解等级:中级

内部节点用特征与条件划分当前样本,叶节点给类别分布或数值预测。贪心选择当前最佳分裂并不保证整棵树全局最优;树深和叶样本等停止条件影响泛化。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      A decision tree is one of the most powerful and widely used tools of supervised learning. It is a tree structure consisting of nodes and branches. In the decision tree, the nodes are split into subnodes based on a threshold value of an attribute. The root node is taken as the training set and is split into two by considering the best attribute and threshold

    参考来源

    - 位置:《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) - 结论依据:摘录中关于树按分裂准则递归划分样本的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:A decision tree is one of the most powerful and widely used tools of supervised learning. It is a tree structure consisting of nodes and branches. In the decision tree, the nodes are split into subnodes based on a threshold value of an attribute. The root node is taken as the training set and is split into two by considering the best attribute and threshold