[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fBjOhxjOwH4y_0P8a--Eg6CO7RU4-vsRw5nOkEFMwMkU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-19 23:46:21",73182907,[8,9,10,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_95097230","决策树","以下那种说法是错误的( )",[21,32,41,50,59,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],73182903,[25,25,26,26,27,27,28,28],"不剪枝","后剪枝","预剪枝","随机剪枝","提前终止某些分支的生长,这个策略的名称是什么","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],73182904,[36,36,37,37,38,38,39,39],"相比划分准则,剪枝方法和程度对决策树泛化性能的影响更为显著","CART算法在候选属性集合中选取使划分后基尼指数最大的属性","划分选择的各种准择对泛化性能的影响有限","划分选择的各种准择对决策树尺寸有较大影响","下列说法错误的是()",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],73182905,[45,45,46,46,47,47,48,48],"通常更高","通常更低","永远更高","永远更低","通常来说,子节点的基尼不纯度与其父节点是什么样的关系",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],73182906,[54,54,55,55,56,56,57,57],"划分前的信息熵-划分后的信息熵","划分前的信息熵\u002F划分后的信息熵","划分后的信息熵+划分前的信息熵","划分后的信息熵-划分前的信息熵","以下哪个选项是信息增益的定义",{"answer":60,"createTime":5,"id":6,"options":61,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],73182908,[66,67,68,69],"CART算法选择基尼系数来选择属性","ID3算法选择信息增益最大的特征作为当前决策节点","C4.5算法不能用于处理不完整数据","C4.5算法选择信息增益率来选择属性","以下关于决策树算法说法错误的是 ( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],73182909,[75,76,77,78],"信息熵","交叉熵","信息增益","信息增益率","C4.5选择属性用的是( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],73182910,[84,85,86,87],"CART算法既可以处理分类问题,也可以处理回归问题","可以处理样本不平衡问题","CART算法采用信息增益率的大小来度量特征的各个划分点","CART 分类树采用基尼系数的大小来度量特征的各个划分点","关于CART算法,错误的是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],73182911,[93,93,94,94,95,95,96,96],"信息增益准则对可取值较少的属性有所偏好","基尼指数反映了从数据集中随机抽取两个样本,其类别标记不一致的概率","基尼指数越小,数据集的纯度越高","C4.5算法并不是直接选择增益率最大的候选划分属性","下列说法错误的是( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],73182912,[102,102,103,103,104,104,105,105],"位于叶结点的样本越来越少","叶结点一定学到一般规律","不会把数据中不该学到的特性学出来","决策树不会过拟合","随着决策树学习时的深度增加,会发生什么现象"]