[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fR8ub4VxTQnmrYqMgKJ1P7136ExilgIkXGNVx6s0FtaA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-06-03 11:28:02",193297496,[8,9,10,11],"信息增益","基尼指数","互信息","误差率",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},40,"ce197edf8a6cbed8862c1b03c77320fa","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0f7822cdc43a4e8e396e5f4a2241c21e.jpg","数据挖掘","9676b0f3c05f444689a8afafff47ed55","作业6 决策树","决策树分类算法中,ID3算法使用哪种度量来选择分裂属性",[21,26,35,41,50,60,69,78,83,91],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],193297507,[30,31,32,33],"一个属性","一个特征","一个类别","一个样本","在决策树中,每个叶节点代表什么",{"answer":36,"createTime":5,"id":37,"options":38,"question":40,"source":24,"type":25},[],193297513,[39,9,10,11],"信息增益率","C4.5算法与ID3算法的主要区别在于C4.5使用哪种度量来构建树",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":24,"type":25},[],193297518,[45,46,47,48],"过拟合","欠拟合","噪声数据","特征选择","决策树中的"剪枝"是为了解决什么问题",{"answer":51,"createTime":52,"id":53,"options":54,"question":59,"source":24,"type":25},[],"2025-06-03 11:28:03",193297520,[55,56,57,58],"继续寻找最佳属性","无法分裂","成为一个叶节点","随机选择一个属性","在构建决策树时,如果一个节点的所有样本都属于同一个类别,那么这个节点将如何分裂",{"answer":61,"createTime":52,"id":62,"options":63,"question":68,"source":24,"type":25},[],193297525,[64,65,66,67],"1","A的值的数量","A的值的数量减1","树的深度不变","在决策树分类算法中,如果属性A的值有多个,那么该属性可以导致树的深度增加多少",{"answer":70,"createTime":52,"id":71,"options":72,"question":77,"source":24,"type":25},[],193297529,[73,74,75,76],"ID3","C4.5","CART","CHAID","在决策树算法中,使用信息增益比率来选择属性的算法是",{"answer":79,"createTime":52,"id":80,"options":81,"question":82,"source":24,"type":25},[],193297531,[73,74,75,76],"决策树算法中,哪个算法得到的结论可以是连续和离散属性",{"answer":84,"createTime":85,"id":86,"options":87,"question":90,"source":24,"type":25},[],"2025-06-03 11:28:04",193297536,[88,55,58,89],"停止分裂","增加样本数量","在决策树中,如果一个节点的样本数量太少,可能会采取什么措施",{"answer":92,"createTime":85,"id":93,"options":94,"question":95,"source":24,"type":25},[],193297539,[73,74,75,76],"在决策树分类算法中,哪个算法使用基尼指数作为节点分裂的度量"]