[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fV4hyBVVHau5I-Iw1R2TCB5emWOKEP6p1T9rRuOfwvEA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-03-24 22:06:13",180193649,[8,9,10,11],"Gain(D,a)+IV(a)","Gain(D,a)-IV(a)","Gain(D,a)*IV(a)","Gain(D,a)\u002FIV(a)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},3,"fc0c1d00e84a5bdd920ca3eef531981e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffb47e65ee6bbb8f896e6b4fca1783b07.png","机器学习初步","95cc067ec2674e28ab4088846246ea1a","4.3 其他属性划分准则","增益率的表达式是Gain_ratio(D,a)=()",[21,32,35],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],180193647,[25,26,27,28],"CART算法在候选属性集合中选取使划分后基尼指数最大的属性","划分选择的各种准则对泛化性能的影响有限","划分选择的各种准则对决策树尺寸有较大影响","相比划分准则,剪枝方法和程度对决策树泛化性能的影响更为显著","下列说法错误的是()","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":30,"type":44},[],180193650,[39,40,41,42],"信息增益准则对可取值较少的属性有所偏好","C4.5算法并不是直接选择增益率最大的候选划分属性","基尼指数反映了从数据集中随机抽取两个样本,其类别标记不一致的概率","基尼指数越小,数据集的纯度越高","下列说法正确的有()",1]