duifen.m

模式识别中使用对分算法进行聚类分析的一种方法

clear all; clc;
X= [1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21;
    0 0 2 2 4 4 5 6 6 7 -4 -2 -3 -3 -5 1 0 0 -1 -1 -3;
    6 5 5 3 4 3 1 2 1 0 3 2 2 0 2 1 -1 -2 -1 -3 -5];
one_number = 21;
two_number = 0;
one_set = X;
two_set = [];
E1=10e-6;
E=0;
total_number = 21;
while(E1 > E)
    flag = 0;
    one_group = one_set;
    two_group = two_set;
    one_number = one_number - 1;
    two_number = two_number + 1;
    E = E1;
    for k = 1 : one_number + 1
        G2 = [two_group , one_group( : , k )];
        G1 = [one_group( : , 1:k-1 ), one_group( : , k+1:one_number + 1)];  
        if (size(G1 , 2) == 1)
            ave1 = G1;
        else
            ave1 = sum( G1'  ) / one_number;
            ave1 = ave1';
        end
        if (size(G2 , 2) == 1)
            ave2 = G2;
        else
            ave2 = sum( G2' ) / two_number;
            ave2 = ave2';
        end
        E2 = (ave1(2:3) - ave2(2:3))'*(ave1(2:3) - ave2(2:3)) * (one_number * two_number) / total_number;
        if (E2 > E1)
            flag = 1;
            E1 = E2;
            max = k;
        end
    end
    if (flag == 1)
        two_set = [two_set , one_set( : , max )];
        one_set = [one_set( : , 1:max-1 ) , one_set(: , max+1 : one_number+1)];
    end
end
first_set = one_set(1 , :) 
second_set = two_set(1 , :)
return