treepartition.m

基于粗糙集的知识约简算法和采用回归进行的知识约简表示

function [SET1,SET2,Y1,Y2]=treepartition(S,Y,a)
%决策树划分将S划分SET1,SET2
[c,r]=size(S);
j=1;
k=1;
SET1=[];
SET2=[];
Y1=[];
Y1=[];
for i=1:c
    if S(i,a)==1
        SET1(j,:)=S(i,:);
        Y1(j,1)=Y(i,1);
        j=j+1;
    else
        SET2(k,:)=S(i,:);
        Y2(k,1)=Y(i,1);
        k=k+1;
    end
    i=i+1;
end