[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fSNjkFD3FTOYTrD8Toftu6ALyFex_mIH45cAiY8Nc3p0":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":24,"origin":109,"createTime":26},58167669,"v1","比较长短期记忆网络(LSTM)和门限循环单元(GRU)网络的差别,以下哪个说法是错误的",[8,9,10,11],"GRU的计算速度优于对应的LSTM","GRU性能一般远强于LSTM","GRU的结构比LSTM简单,减少了计算量","GRU是LSTM的简化,保留了遗忘门,合并了输出和状态两种向量",[],[14,27,37,47,57,67,77,87,97,105],{"id":15,"source":5,"question":16,"options":17,"answer":22,"related":23,"type":24,"origin":25,"createTime":26},58167660,"逻辑回归将输出概率限定在 [0,1] 之间.下列________函数起到这样的作用",[18,19,20,21],"sigmoid","ReLU","Leaky ReLU","tanh",[],[],0,null,"2023-06-11T13:02:46+08:00",{"id":28,"source":5,"question":29,"options":30,"answer":35,"related":36,"type":24,"origin":25,"createTime":26},58167661,"在决策树建立过程中,使用一个属性对某个节点对应的数据集合进行划分后,结果具有高信息熵(high entropy),对于结果的描述,最贴切的是( )",[31,32,33,34],"有用","纯度低","纯度高","无用",[],[],{"id":38,"source":5,"question":39,"options":40,"answer":45,"related":46,"type":24,"origin":25,"createTime":26},58167662,"对于机器学习,下列表述完全正确的是",[41,42,43,44],"机器学习是人工智能的核心和重要分支","机器学习的目标是让机器设备像人类一样学习书本知识","机器学习是指一系列程序逻辑控制算法","机器学习和人工智能是独立的两种技术",[],[],{"id":48,"source":5,"question":49,"options":50,"answer":55,"related":56,"type":24,"origin":25,"createTime":26},58167663,"以下哪种方法不属于监督学习方法( )",[51,52,53,54],"K-means","集成学习","回归","支持向量机",[],[],{"id":58,"source":5,"question":59,"options":60,"answer":65,"related":66,"type":24,"origin":25,"createTime":26},58167664,"下列关于PCA说法不正确的是",[61,62,63,64],"可以使用PCA在低维空间可视化数据","使用PCA之前,必须标准化数据","应该选择具有最小方差的主成分","应该选择具有最大方差的主成分",[],[],{"id":68,"source":5,"question":69,"options":70,"answer":75,"related":76,"type":24,"origin":25,"createTime":26},58167665,"在Adaboost的迭代中,从第t轮到第t+1轮,某个被错误分类样本的惩罚被增加了,可能因为该样本( )",[71,72,73,74],"被第t轮后的集成分类器(强分类器)错误分类","被到第t轮为止训练的大多数弱分类器错误分类","被第t轮训练的弱分类器错误分类","B 和C都正确",[],[],{"id":78,"source":5,"question":79,"options":80,"answer":85,"related":86,"type":24,"origin":25,"createTime":26},58167666,"在一个监督学习任务中,每个数据样本有3个属性和一个类别标签,每种属性分别有3、2、2、2种可能的取值,类别标签有3种不同的取值.请问有多少类不同的样本?( )",[81,82,83,84],"3","无法判断","72","54",[],[],{"id":88,"source":5,"question":89,"options":90,"answer":95,"related":96,"type":24,"origin":25,"createTime":26},58167667,"如果在大型数据集上训练决策树,为了花费更少的时间来训练这个模型,下列哪种做法是正确的",[91,92,93,94],"增加学习率","减少树的数量","增加树的深度","减少树的深度",[],[],{"id":98,"source":5,"question":99,"options":100,"answer":103,"related":104,"type":24,"origin":25,"createTime":26},58167668,"以下哪个方法不能对文本分类",[51,54,101,102],"KNN","决策树",[],[],{"id":4,"source":5,"question":6,"options":106,"answer":107,"related":108,"type":24,"origin":25,"createTime":26},[8,9,10,11],[],[],{"courseName":110,"courseImg":111,"workName":112,"workId":113,"count":114,"courseId":115},"人工智能算法基础","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","6.11-期末综合测试","work_28141890",10,"82a25bd619f65fe3671173af5a21970a"]