[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f_PCVlK8A0ZQLKLApibTEdQi8KkzjoaTTOkLoBDWnfg4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-11-18 21:08:12",166424258,[8,9,10,11],",训练基分类器时采用并行的方式",",Boosting方法的主要思想是迭代式学习",",测试时,根据各层分类器的结果的加权得到最终结果",",基分类器层层叠加,每一层在训练时,对前一层基分类器分错的样本基于更高的权值",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},15,"abe24bfd424e765ee5ac0af8144abfeb","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9e2c5eca1e58f931524bccb756700a0b.png","【24秋】数据挖掘原理与实践","exam_137479393","测试二(45分钟)_数据分类","下列关于Boosting的说法错误的是( )",[21,32,41,44,53,62,71,77,86,95],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],166424256,[25,26,27,28],",平均法","学习法","投票法","以上答案都是正确","在集成学习中,对于数据型输出,最常见的结合策略是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],166424257,[36,37,38,39],",互斥规则",", 无序规则",",有序规则",",穷举规则","如果规则集R中不存在两条规则被同一条记录触发,则称规则集R中的规则为( )",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],166424259,[48,49,50,51],",SVM",",Bayes",",KNN",",神经网络","以下哪些分类方法可以较好地避免样本的不平衡问题,( )",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],166424260,[57,58,59,60],"针对同一个训练集训练不同的弱分类器并集合起来,构成一个强分类器","给定一个弱学习算法和一个训练集,将学习算法使用多次,得出预测函数序列,进行投票","利用多棵树对样本训练并预测的一种分类器","基于前向策略的加法模型,每阶段使用一个基模型去拟合上一阶段基模型的残差","Adaboost的核心思想是( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],166424261,[66,67,68,69],"子树可能在决策树中重复多次","决策树算法对于噪声的干扰非常敏感","冗余属性不会对决策树的准确率造成不利的影响","寻找最佳决策树是NP完全问题","以下哪项关于决策树的说法是错误的 ( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":76,"source":30,"type":31},[],166424262,[38,75,39,37],", 互斥规则","如果规则集中的规则按照优先级降序排列,则称规则集是 ( )",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":30,"type":31},[],166424263,[81,82,83,84],",内部结点(internal node)",",根结点(root node)",",外部结点(external node)",",叶结点(leaf node)","决策树中不包含一下哪种结点, ( )",{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":30,"type":31},[],166424264,[90,91,92,93],", 0.5738",", 0.75",", 0.35",",0.4678","考虑两队之间的足球比赛:队0和队1.假设65%的比赛队0胜出,剩余的比赛队1获胜.队0获胜的比赛中只有30%是在队1的主场,而队1取胜的比赛中75%是主场获胜.如果下一场比赛在队1的主场进行队1获胜的概率为 ( )",{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":30,"type":31},[],166424265,[99,100,101,102],"基于度量的排序方案","基于类的排序方案","基于规格的排序方案","基于规则的排序方案","在基于规则分类器的中,依据规则质量的某种度量对规则排序,保证每一个测试记录都是由覆盖它的"最好的"规格来分类,这种方案称为 ( )"]