决策树：检查您的理解情况
使用集合让一切井井有条
根据您的偏好保存内容并对其进行分类。
本页面将为您提供一系列多选题练习，以便您巩固“决策树”单元中所学内容。
问题 1
决策树的推理是通过路由示例来运行的...
从一片叶子到另一片叶子。
所有推理都从根开始，而不是从叶开始。
问题 2
所有条件是否都仅涉及一项地图项？
单元编号
虽然轴心对齐的条件仅涉及单个地图项，但倾斜的条件涉及多个地图项。
问题 3
考虑以下针对两个特征 x1 和 x2 的预测图：
Which of the following decision trees match the prediction map?
决策树 B。
如果条件 x2 ≥ 0.5 为否，则叶子可能为蓝色，也可能不是，因此这是一个不良条件。
决策树 C.
如果 x1 不大于等于 1.0，则叶子应为“蓝色”，而不是“橙色”，因此这是错误的叶子。
如未另行说明，那么本页面中的内容已根据知识共享署名 4.0 许可获得了许可，并且代码示例已根据 Apache 2.0 许可获得了许可。有关详情，请参阅 Google 开发者网站政策。Java 是 Oracle 和/或其关联公司的注册商标。
最后更新时间 (UTC)：2025-07-27。
[null,null,["最后更新时间 (UTC)：2025-07-27。"],[[["\u003cp\u003eThis page provides multiple choice questions to test your understanding of decision trees.\u003c/p\u003e\n"],["\u003cp\u003eThe questions cover topics such as decision tree inference, types of conditions used in decision trees, and interpretation of decision tree prediction maps.\u003c/p\u003e\n"],["\u003cp\u003eCorrect answers are provided with explanations to reinforce learning.\u003c/p\u003e\n"]]],[],null,["# Decision trees: Check your understanding\n\n\u003cbr /\u003e\n\nThis page challenges you to answer a series of multiple choice exercises\nabout the material discussed in the \"Decision trees\" unit.\n\nQuestion 1\n----------\n\nThe inference of a decision tree runs by routing an example... \nfrom the leaf to the root. \nAll inference starts from the root (the first condition). \nfrom one leaf to another. \nAll inference starts from the root, not from a leaf. \nfrom the root to the leaf. \nWell done!\n\nQuestion 2\n----------\n\nDo all conditions involve only a single feature? \nYes. \nOblique features test multiple features. \nNo. \nAlthough axis-aligned conditions only involve a single feature, oblique conditions involve multiple features.\n\nQuestion 3\n----------\n\nConsider the following prediction map on two features x1 and x2:\n\nWhich of the following decision trees match the prediction map? \nDecision Tree A. \nYes! \nDecision Tree B. \nIf the condition x2 ≥ 0.5 is no, then the leaf may or may not be blue, so this is a bad condition. \nDecision Tree C. \nIf x1 is not ≥ 1.0, then the leaf should be 'blue' rather than 'orange', so this is the wrong leaf."]]
