fisher.m

fisher最优分割法的MATLAB算法

y=input('8.07 9.96 11.44 12.67 13.71 14.61 16.73 22.63 25.46 42.18 50.79 51.00	47.70 46.35 47.51 47.92 51.45 54.36 55.75 57.17 60.06 63.67 67.54 69.99 71.56 73.79 78.36 82.34 85.56 89.02 87.58	88.33 89.75 90.70 91.51 92.67 94.24	96.28	98.22	99.96 101.43 102.83 104.11 105.67 108.35 111.78 115.70 118.58 122.64 127.85 135.17 140.27 169.80 176.52 180.98 187.07 334.52 345.70 358.37');
A=sort(y);
n=length(A);
D=zeros(n);
for i=1:n;
    for j=i:n
        x(i,j)=sum(A(i:j))/(j-i+1)
        D(i,j)=sum((A(i:j)-x(i,j))^2;
    end
end
H=zeros(n);
M=zeros(n);
H(1,:)=D(1,:);
for k=2:n
    for m=k:n
        R=zeros(1,m-k+1);
        for i=k-1:m-1
            R(i-k+2)=H(k-1,i)+D(i+1,m);
        end
        t=find(R==min(R));
        H(k,m)=R(t);
        M(k,m)=t+k-2;
    end
end
x=1:14;
y=H(2:15,n)';
plot(x,y,'r-')
xlabel('分类数')
ylabel('L[P(n,k)]')
T_k=n;
jujian(k)=A(T_(k-1)+1:n)
for t= k-1:1
    T_t=M(k,T_(t+1));
    jujian(t+1)A(T_(t+1):T_t)
    Point(t)=A(T_t);
end
jujian(1)=A(1:T_1)