4、 过程: 1)ifSisemptyorTisemptythen returnTree end 2)selecttfromT andcreateatreenodeparentNodeastheroot 3)splitSinS1,S2,...,Skbythevalueoft(根据t的k个可能取值,将S划分为子集S1,S2,...Sk) 4)foreachSi do ifthesamplesinsihavesameclasslabel
5、 then inserttheclasslableasthechildnodeforparentNode else childTree=CreateTree(Si,T-t) addchildTreerootasthechildNodeforparentNode end end 5)T<-T-tandgoto1)算法的注意点:在步骤2中selectt