[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f1kn5l_BtSjc34jcVlBnTfeM8Grmc2yZNxItvTjixrkg":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-19 17:45:42",71983314,[8,8,9,9,10,10,11,11],"后剪枝","不剪枝","预剪枝","随机剪枝",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},26,"c1afc5ba0f79a0d744484afeb566c2ef","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F592f6fb7749e2b0bff96f113b3c11fe6.jpg","机器学习","exam_95095654","决策树","提前终止某些分支的生长,这个策略的名称是什么",[21,32,41,44,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],71983312,[25,25,26,26,27,27,28,28],"预剪枝在树的训练过程中通过停止分裂对树的规模进行限制","决策树的剪枝算法可以分为两类,分别称为预剪枝和后剪枝","后剪枝先构造出一棵完整的树,然后通过某种规则消除掉部分节点,用叶子节点替代","对于同一棵树,进行预剪枝和后剪枝得到的决策树是一样的","关于剪枝,下列说法错误的是()","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],71983313,[36,37,38,39],"ID3算法选择信息增益最大的特征作为当前决策节点","C4.5算法不能用于处理不完整数据","CART算法选择基尼系数来选择属性","C4.5算法选择信息增益率来选择属性","以下关于决策树算法说法错误的是 ( )",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,8,9,9,10,10,11,11],{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],71983315,[48,48,49,49,50,50,51,51],"CART算法在候选属性集合中选取使划分后基尼指数最大的属性","相比划分准则,剪枝方法和程度对决策树泛化性能的影响更为显著","划分选择的各种准择对决策树尺寸有较大影响","划分选择的各种准择对泛化性能的影响有限","下列说法错误的是()",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],71983316,[57,57,58,58,59,60,60],"将测试示例从根节点开始,沿着划分属性所构成的"判定测试序列"下行,直到叶节点","将测试示例从叶节点开始,沿着划分属性所构成的"判定测试序列"上行,直到根节点","将测试示例从一个中间节点开始,沿着划分属性所构成的"判定测试序列"下行,直到叶节点","将测试示例从一个中间节点开始,沿着划分属性所构成的"判定测试序列"上行,直到根节点","下列选项哪个是决策树的预测过程",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],71983317,[66,67,68,69],"C4.5算法采用基尼系数的大小来度量特征的各个划分点","C4.5算法可以处理非离散的数据","C4.5算法引入悲观剪枝策略进行后剪枝","C4.5 算法最大的特点是克服了 ID3 对特征数目的偏重这一缺点","关于C4.5算法,错误的是( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],71983318,[75,76,77,78],"推理过程容易理解,计算简单","算法容易造成过拟合","算法考虑了数据属性之间的相关性","算法自动忽略了对模型没有贡献的属性变量","以下关于决策树特点分析的说法错误的有 ( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],71983319,[84,85,86,87],"可以处理样本不平衡问题","CART 分类树采用基尼系数的大小来度量特征的各个划分点","CART算法既可以处理分类问题,也可以处理回归问题","CART算法采用信息增益率的大小来度量特征的各个划分点","关于CART算法,错误的是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],71983320,[93,93,94,94,95,95,96,96],"纯度","大小","重要性","对称差","信息熵Entrophy是度量样本集合___________最常用的一种指标",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],71983321,[102,103,104,105],"决策树生成过程中需要用到分割法","决策树算法属于无监督学习","决策树算法本质上是贪心算法","决策树决策过程从根节点开始","以下关于决策树原理介绍错误的有 ( )"]