chongpai_4_0_1.m

来自「决策树」· M 代码 · 共 44 行

function data_4_0_1=chongpai_4_0_1(num1,num2,data,cla_point_0_1_0,cla_point_0_1_1)
num1=num1;
num2=num2;
data_4_0_1=zeros(num2,12);
switch cla_point_0_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
data_4_0_1_0=data_u;
switch cla_point_0_1_1
    case 1
        data_u=chong_2_1(1,num1,num2-num1,data(num1+1:num2,:));
    case 2
        data_u=chong_2_1(2,num1,num2-num1,data(num1+1:num2,:));
    case 3
        data_u=chong_2_1(3,num1,num2-num1,data(num1+1:num2,:));
    case 4
        data_u=chong_2_1(4,num1,num2-num1,data(num1+1:num2,:));
    case 5
        data_u=chong_2_1(5,num1,num2-num1,data(num1+1:num2,:));
    case 6
        data_u=chong_2_1(6,num1,num2-num1,data(num1+1:num2,:));
    otherwise
        return;
end
data_4_0_1_1=data_u;
for i=1:num1
    data_4_0_1(i,:)=data_4_0_1_0(i,:);
end
for i=1:num2-num1
    data_4_0_1(num1+i,:)=data_4_0_1_1(i,:);
end