[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fum0oXpmdNnXIjdgF9JBk-YphBcsKXbdXTPmOvDNblqY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":35},[],"2025-03-28 00:01:39",180559844,[8,9,10,11],"决策树的剪枝算法可以分为两类,分别称为预剪枝和后剪枝","对于同一棵树,进行预剪枝和后剪枝得到的决策树是一样的","预剪枝在树的训练过程中通过停止分裂对树的规模进行限制","后剪枝先构造出一棵完整的树,然后通过某种规则消除掉部分节点,用叶子节点替代",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},2,"fc0c1d00e84a5bdd920ca3eef531981e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffb47e65ee6bbb8f896e6b4fca1783b07.png","机器学习初步","fcd5564fa0c84c809ab868e730bad16f","4.6 决策树简史","下列说法正确的有()",[21,32],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],180559843,[25,26,27,28],"1956","1966","1979","1993","第一篇关于决策树的工作在哪一年发表的","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":35},[],[8,9,10,11],1]