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