chongpai_3_1.asv

来自「决策树」· ASV 代码 · 共 47 行

function data_3_1=chongpai_3_1(num1,num2,data, cla_point_1_0 , cla_point_1_1)
data_3_1=zeros((num1+num2),12);
num1=num1;
num2=num2;
if cla_point_1_0~=0
switch cla_point_1_0
    case 1
        data_u=chong_2_0(1,num1,data(1:num1,:));
    case 2
        data_u=chong_2_0(2,num1,data(1:num1,:));
    case 3
        data_u=chong_2_0(3,num1,data(1:num1,:));
    case 4
        data_u=chong_2_0(4,num1,data(1:num1,:));
    case 5
        data_u=chong_2_0(5,num1,data(1:num1,:));
    case 6
        data_u=chong_2_0(6,num1,data(1:num1,:));
    otherwise
        return;
end
else
    
data_3_1_0=data_u;
switch cla_point_1_1
    case 1
        data_u=chong_2_1(1,num1,num2,data(num1+1:num1+num2,:));
    case 2
        data_u=chong_2_1(2,num1,num2,data(num1+1:num1+num2,:));
    case 3
        data_u=chong_2_1(3,num1,num2,data(num1+1:num1+num2,:));
    case 4
        data_u=chong_2_1(4,num1,num2,data(num1+1:num1+num2,:));
    case 5
        data_u=chong_2_1(5,num1,num2,data(num1+1:num1+num2,:));
    case 6
        data_u=chong_2_1(6,num1,num2,data(num1+1:num1+num2,:));
    otherwise
        return;
end
data_3_1_1=data_u;
for i=1:num1
    data_3_1(i,:)=data_3_1_0(i,:);
end
for i=1:num2
    data_3_1(num1+i,:)=data_3_1_1(i,:);
end