[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fXlK198FySV6Ivw8vMLiqGXEeqfYIZpGJUmSBl3BJhkM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":33,"type":34},[],"2024-04-28 09:25:06",140694423,[8,9,10,11],"Apriori算法是一个迭代算法","数据采用水平组织方式,适合事务数据库的关联规则挖掘","采用Apriori优化方法","适合稀疏数据集",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},6,"a027dec603efc46ca3ba602449beab20","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffe12dd7e6ea2c69726dda53123b76939.png","数据挖掘与机器学习","work_33214153","8.2 Aprior算法","下列哪些是Apriori算法的优点",[21,35,44,47,56,64],{"answer":22,"createTime":5,"id":23,"options":24,"question":32,"source":33,"type":34},[],140694421,[25,26,27,28,29,30,31],"任何频繁项集的子集都是频繁项集","任何非频繁项集的超集都为非频繁项集","任何频繁k项集都是由频繁k−1项集组合生成的","任何频繁项集的超集都是频繁项集",":A,B,C","程度:难","解析:A.任何频繁项集的子集都是频繁项集B.任何非频繁项集的超集都为非频繁项集","下列关于频繁项目集的性质正确的有( )","v1",1,{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":33,"type":34},[],140694422,[39,40,41,42],"连接","剪枝","扫描筛选","关联","Apriori算法的频繁项集产生过程中重要的三部是什么",{"answer":45,"createTime":5,"id":6,"options":46,"question":19,"source":33,"type":34},[],[8,9,10,11],{"answer":48,"createTime":5,"id":49,"options":50,"question":55,"source":33,"type":34},[],140694424,[51,52,53,54],"多次扫描事务数据库,需要很大的I\u002FO负载","可能产生庞大的候选集","候选项集支持度计算量大,尤其在频繁项目集长度变大的情况下,运算时间显著增加","适合大规模数据","下列哪些是Apriori算法的缺点",{"answer":57,"createTime":5,"id":58,"options":59,"question":62,"source":33,"type":63},[],140694425,[60,61],"正确","错误","Apriori算法在处理大数据集时效率较低",3,{"answer":65,"createTime":5,"id":66,"options":67,"question":68,"source":33,"type":63},[],140694426,[60,61],"Apriori算法是一种基于频繁项集的挖掘算法,只能用于发现单层关联规则"]