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