[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fOU7oJSBi2Kk9vY0EYqqZrx0xqM2W3TsIsx3WzpppKMc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":30,"type":113},[],"2025-05-06 08:14:26",185808135,[8,9,10,11],"位于叶结点的样本越来越少","不会把数据中不该学到的特性学出来","决策树可能过拟合","叶结点一定学到一般规律",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":16},85,"fc0c1d00e84a5bdd920ca3eef531981e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffb47e65ee6bbb8f896e6b4fca1783b07.png","机器学习初步","exam_155400739","随着决策树学习时的深度增加,会发生什么现象",[20,32,41,50,59,68,77,86,95,104],{"answer":21,"createTime":22,"id":23,"options":24,"question":29,"source":30,"type":31},[],"2025-05-06 08:14:24",185807632,[25,26,27,28],"所有&quot;问题&quot;难度不同","所有&quot;问题&quot;出现的机会服从任意分布","所有&quot;问题&quot;出现的机会不相同","所有&quot;问题&quot;出现的机会相同","以下哪个选项是NFL定理的重要前提","v1",0,{"answer":33,"createTime":22,"id":34,"options":35,"question":40,"source":30,"type":31},[],185807640,[36,37,38,39],"纯度","对称差","大小","重要性","信息熵是度量样本集合()最常用的一种指标",{"answer":42,"createTime":22,"id":43,"options":44,"question":49,"source":30,"type":31},[],185807651,[45,46,47,48],"较高的簇内相似度","较低的簇内相似度","较大的簇间距离","和某个参考模型的结果相似","一个好的聚类可能存在的特征通常不包括",{"answer":51,"createTime":22,"id":52,"options":53,"question":58,"source":30,"type":31},[],185807662,[54,55,56,57],"X^⊤ X不满秩","X^⊤ X满秩","XX^⊤满秩","XX^⊤不满秩","当下列哪个条件满足时,多元线性回归的最小二乘解唯一",{"answer":60,"createTime":22,"id":61,"options":62,"question":67,"source":30,"type":31},[],185807673,[63,64,65,66],"训练样本个数大于属性可能的取值数","训练样本个数小于属性可能的取值数","训练样本不充分、属性可能的取值数有限","训练样本不充分、属性有无限种可能的取值","拉普拉斯修正不适用于以下哪种情况",{"answer":69,"createTime":22,"id":70,"options":71,"question":76,"source":30,"type":31},[],185807684,[72,73,74,75],"计算机数值精度有限","样例维度大于样例数","样例的采样过程存在偏差","存在大量线性相关的样例","下列哪个选项不是多元线性回归使用正则化的原因",{"answer":78,"createTime":22,"id":79,"options":80,"question":85,"source":30,"type":31},[],185807692,[81,82,83,84],"降低;降低","降低;增加","增加;降低","增加;增加","后剪枝的测试时间开销(),训练时间开销()",{"answer":87,"createTime":22,"id":88,"options":89,"question":94,"source":30,"type":31},[],185807706,[90,91,92,93],"经验","专家","规则","实践","机器学习的经典定义是:利用 () 改善系统自身的性能",{"answer":96,"createTime":22,"id":97,"options":98,"question":103,"source":30,"type":31},[],185807716,[99,100,101,102],"通过任意支持向量都能够求解出截距项","为了提高鲁棒性, 通常使用所有支持向量求解的平均值","通过任意样本都能够求解出截距项","截距项的求解能够体现支持向量机学习到的超平面仅与少量支持向量有关","在求解支持向量机截距项的时候错误的说法是()",{"answer":105,"createTime":22,"id":106,"options":107,"question":112,"source":30,"type":31},[],185807724,[108,109,110,111],"划分前的信息熵-划分后的信息熵","划分后的信息熵-划分前的信息熵","划分前的信息熵\u002F划分后的信息熵","划分后的信息熵+划分前的信息熵","以下哪个选项是信息增益的定义",1]