[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fOXP9uyca1ZQeblMCZb5sugAkQFNcxi--Ico6PUIHFi0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-06-24 00:41:26",185927369,[8,9,10,11],"对于线性可分的训练样本,存在唯一的超平面将训练样本全部分类正确","间隔只与 w 有关, 与 b 无关","支持向量机训练完成后, 最后的解与所有训练样本都有关","对于线性可分的训练样本, 支持向量机算法学习得到的能哆将训练样本正确分类且具有"最大间隔"的超平面是存在并且唯一的",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},48,"8918ca170ab255299558f67cd4aa8a6a","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fda81200f3c2573fd99e5376ca1429a86.jpg","机器学习","work_43205571","第6章 支持向量机","机基本型中间隔、支持向量和超平面 w x+b=0 的说法,下列说法正确的是",[21,26,35,45,54,63,72,81,91,100],{"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},[],185927371,[30,31,32,33],"在推导对偶问题时, 引入的拉格朗日乘子没有约束条件","对偶问题需要满足KKT条件","对偶问题的最优值是原始问题最优值的下界","通过对偶问题推导出的模型表达式能够体现解的稀疏性","下面关于支持向量机对偶问题的说法错误的是",{"answer":36,"createTime":37,"id":38,"options":39,"question":44,"source":24,"type":25},[],"2025-06-24 00:41:27",185927373,[40,41,42,43],"高斯核函数","0\u002F1损失函数","交叉熵函数","指数损失函数","以下属于常用核函数的是( )",{"answer":46,"createTime":5,"id":47,"options":48,"question":53,"source":24,"type":25},[],185927375,[49,50,51,52],"软间隔是支持向量机缓解过拟合的一种手段","采用hinge损失函数后仍保持了SVM解的稀疏性","正则化参数C越小, 模型对分类错误的容忍度越高","软间隔的基本思路为在最大化间隔的同时, 让不满足约束的样本尽可能少","下面有关软间隔支持向量机说法错误的是 ()",{"answer":55,"createTime":37,"id":56,"options":57,"question":62,"source":24,"type":25},[],185927377,[58,59,60,61],"应用核函数","回代求解参数","令偏导数为零","引入拉格朗日乘子","SVM对偶问题求解中,拉格朗日乘子法第二步是( )",{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":24,"type":25},[],185927379,[67,68,69,70],"仅适用于线性可分数据","严格等于0\u002F1损失","是0\u002F1损失的上界","非凸且非连续","替代损失函数需满足的条件是( )",{"answer":73,"createTime":5,"id":74,"options":75,"question":80,"source":24,"type":25},[],185927381,[76,77,78,79],"将训练样本分开的超平面仅由支持向量决定","支持向量机的核心思想是最大化间隔","以上选项存在说法错误的","支持向量机基本型是一个凸二次规划问题","下面关于支持向量机的说法错误的是",{"answer":82,"createTime":83,"id":84,"options":85,"question":90,"source":24,"type":25},[],"2025-06-23 23:13:35",185927383,[86,87,88,89],"高维空间的离散点","线性模型的组合","随机森林的集成","核函数的线性组合","表示定理表明,SVM模型可以表示为( )",{"answer":92,"createTime":37,"id":93,"options":94,"question":99,"source":24,"type":25},[],185927385,[95,96,97,98],"无约束优化问题","随机优化问题","有约束优化问题","非凸优化问题","拉格朗日乘子法用于解决( )",{"answer":101,"createTime":5,"id":102,"options":103,"question":108,"source":24,"type":25},[],185927387,[104,105,106,107],"支持向量回归模型的解仍然具有稀疏性","间隔带两侧的松弛程度可有所不同","支持向量回归也存在对偶问题","支持向量回归一般要求损失为 0 当且仅当模型的输出和实际值一样","下面关于支持向量回归, 说法错误的是"]