[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fkB_n6C6tzTer9tWva6Up4dbFj20FM7Jb7YCKh8Onbdc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":17,"related":18,"source":28,"type":111},[],"2025-12-01 15:59:28",246894431,[8,9],"正确","错误",{"count":11,"courseId":12,"courseImg":13,"courseName":14,"workId":15,"workName":16},190,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","exam_168307189","人人爱设计","决策树剪枝的基本策略只有"后剪枝"",[19,30,39,48,57,66,75,84,93,102],{"answer":20,"createTime":5,"id":21,"options":22,"question":27,"source":28,"type":29},[],246894359,[23,24,25,26],"以上都是","寻找数据内在的分布结构","作为其他学习任务的前驱过程","帮助寻找潜在的概念或者类别","下面哪一项属于聚类的作用","v1",0,{"answer":31,"createTime":5,"id":32,"options":33,"question":38,"source":28,"type":29},[],246894360,[34,35,36,37],"泛化误差","训练误差","学习误差","经验误差","模型在"未来"样本上的误差被称作()",{"answer":40,"createTime":5,"id":41,"options":42,"question":47,"source":28,"type":29},[],246894361,[43,44,45,46],"标记噪声","过拟合","欠拟合","数据少","剪枝是决策树学习算法对付什么现象的主要手段",{"answer":49,"createTime":5,"id":50,"options":51,"question":56,"source":28,"type":29},[],246894362,[52,53,54,55],"聚类","分而治之","集成","排序","决策树学习的策略是什么",{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":28,"type":29},[],246894363,[61,62,63,64],"以上三个选项都不需要考虑","性能度量","比较检验","评估方法","为了说明模型在统计意义上表现好, 我们最需要考虑",{"answer":67,"createTime":5,"id":68,"options":69,"question":74,"source":28,"type":29},[],246894364,[70,71,72,73],"增加;降低","增加;增加","降低;降低","降低;增加",""一对一"相较于"一对其余",存储开销(),测试时间开销()",{"answer":76,"createTime":5,"id":77,"options":78,"question":83,"source":28,"type":29},[],246894365,[79,80,81,82],"计算开销大","上溢","下溢","内存不足","极大似然中,若直接连乘,易造成什么现象",{"answer":85,"createTime":5,"id":86,"options":87,"question":92,"source":28,"type":29},[],246894366,[88,89,90,91],"100%","93%","90%","95%","Tufts医学中心引入机器学习技术后,人类专家阅读1000篇摘要,得到的系统自动筛选敏感度可以达到()",{"answer":94,"createTime":5,"id":95,"options":96,"question":101,"source":28,"type":29},[],246894368,[97,98,99,100],"在使用SMO时需要先推导出支持向量机的对偶问题","SMO需要迭代的进行求解, 且每一步迭代的子问题不存在闭式解","可以通过SMO进行高效的求解","可以通过常规的优化计算包求解","关于支持向量机的优化描述错误的是",{"answer":103,"createTime":5,"id":104,"options":105,"question":110,"source":28,"type":29},[],246894370,[106,107,108,109],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fafaa9fa9ff2f6da52f16b46d69dc5b13.png\"> s.t. \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F89776c958b6074ee6727eac973a31cb8.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fafaa9fa9ff2f6da52f16b46d69dc5b13.png\"> s.t. \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2980ef4e14453000f32f034176b4d18a.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fafaa9fa9ff2f6da52f16b46d69dc5b13.png\"> s.t. \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7f63905012e1e3634e0fcd5ad9a65ab3.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fafaa9fa9ff2f6da52f16b46d69dc5b13.png\"> s.t. \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb0a596d765f464db3e8898576c009c99.png\">","将样本映射到高维空间后,支持向量机问题的表达式为",3]