[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f1T2qxqo2Gg_2hs32hF3hiPKpmJaB582jCn5aQTDXnP8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-06-13 21:46:37",151249030,[8,9,10,11],"sklearn","Matplotlib","Pandas","pylab",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},131,"8e18e890ef10a7e5a5ba2d0a116bf402","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","人工智能技术应用","work_35662881","232402作业","读取 CSV文件中的数据用( )包",[21,32,41,50,53,60,65,70,79,88],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],151249027,[25,26,27,28],"sex()","max()","count()","sum()","常用的聚合函数不包括 ( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],151249028,[36,37,38,39],"信息记录","信息的推理分析","信息清洗","信息传播","从宏观角度来看,数据可视化的功能不包括( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],151249029,[45,46,47,48],"聚类","分类","关联分析","隐马尔可夫链","当不知道数据所带的标签时,可以使用( )技术促使带同类标答的数据与带其他标签的数据相分离",{"answer":51,"createTime":5,"id":6,"options":52,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":54,"createTime":5,"id":55,"options":56,"question":59,"source":30,"type":31},[],151249031,[57,58],"对","错","对于支持向量机,待分类样本集中的大部分样本不是支持向量,移去或者减少这些样本对分类结果没有影响( )",{"answer":61,"createTime":5,"id":62,"options":63,"question":64,"source":30,"type":31},[],151249032,[57,58],"分类和回归都可用于预测,分类的输出是离散的类别值,而回归的输出是连续数值( )",{"answer":66,"createTime":5,"id":67,"options":68,"question":69,"source":30,"type":31},[],151249033,[57,58],"分类模型的误差大致分为两种:训练误差(Training Error)和泛化误差(GeneralizationError)( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":30,"type":31},[],151249034,[74,75,76,77],"初始值不同,,最终结果可能不同","能找到任意形状的聚类","每次迭代的时间复杂度是O(n2),其中n是样本数量","不能使用核函数","关于K-Means,描述正确的是( )",{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":30,"type":31},[],151249035,[83,84,85,86],"K-Means丢弃被它识别为噪声的对象,而 DBSCAN一般聚类所有对象","K-Means使用簇的基于原型的概念,而 DBSCAN使用基于密度的概念","K-Means很难处理非球形的簇和不同大小的簇,而 DBSCAN可以处理不同形状和不同大小的簇","K-Means可以发现不是明显分离的簇,即使簇有重叠它也可以发现,但是DBSCAN会合并有重叠的簇","关于K-Means和 DBSCAN的比较,以下说法不正确的是( )",{"answer":89,"createTime":90,"id":91,"options":92,"question":97,"source":30,"type":31},[],"2024-06-13 21:46:38",151249036,[93,94,95,96],"变量不必事先声明","变量无须先创建和赋值即可直接使用","变量无须指定类型","可以使用del释放资源","关于Python变量的使用,说法错误的是( )"]