[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fWjFu0dnuEAbe9orewC6UKfZI7J3ClT2D4TdjS4DVyDc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-09-25 21:06:04",160211087,[8,9,10,11],"均方误差为0","均方误差最大","均方误差最小","均方误差为1",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},23,"8cb5f529548250abb4f9a8cfbd7d4aa8","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","机器学习与模式识别","work_37019405","第三、四章 作业","最小二乘参数估计得到的线性回归模型满足什么性质",[21,32,41,50,59,68,77,86,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],160211080,[25,26,27,28],"分而治之","集成","聚类","排序","决策树学习的策略是什么","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],160211081,[36,37,38,39],"给定划分属性,若样本在该属性上的值缺失,会按进入权重最大的一个分支","给定划分属性,若样本在该属性上的值缺失,会按权重随机进入一个分支","给定划分属性,若样本在该属性上的值缺失,会按权重同时进入所有分支","给定划分属性,若样本在该属性上的值缺失,会按进入权重最小的一个分支","决策树处理缺失值的基本思路是"样本赋权,权重划分",其中"权重划分"指的是以下哪个选项",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],160211082,[45,46,47,48],"将测试示例从一个中间节点开始,沿着划分属性所构成的"判定测试序列"下行,直到叶节点","将测试示例从一个中间节点开始,沿着划分属性所构成的"判定测试序列"上行,直到根节点","将测试示例从叶节点开始,沿着划分属性所构成的"判定测试序列"上行,直到根节点","将测试示例从根节点开始,沿着划分属性所构成的"判定测试序列"下行,直到叶节点","下列选项哪个是决策树的预测过程",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],160211083,[54,55,56,57],"划分前的信息熵-划分后的信息熵","划分后的信息熵-划分前的信息熵","划分前的信息熵\u002F划分后的信息熵","划分后的信息熵+划分前的信息熵","以下哪个选项是信息增益的定义",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],160211084,[63,64,65,66],"具有中心对称性","严格大于0","单调且任意阶可导","不需要写成分段形式","对数几率函数作为单位阶跃函数的替代函数的优点是什么",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],160211085,[72,73,74,75],"不连续且不可微","单调增","非负","最大值为1","单位阶跃函数的缺点是什么",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":30,"type":31},[],160211086,[81,82,83,84],"Gain(D,a)+IV(a)","Gain(D,a)-IV(a)","Gain(,a)*IV(a)","Gain(D,a)\u002FIV(a)","增益率的表达式是Gain_ratio(D,a)=()",{"answer":87,"createTime":5,"id":6,"options":88,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],160211088,[93,94,95,96],"降低;降低","降低;增加","增加;降低","增加;增加","后剪枝的测试时间开销(),训练时间开销()",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],160211089,[102,103,104,105],"可以用于求解对数几率回归","是一种迭代求解的方法","可以比较好的并行化","可以高效地求解所有凸优化问题","下列关于梯度下降法描述错误的是"]