code.m

基于遗产算法的FCM算法

function out=code(g,cluster_n,N,max,min,k)
% g=round(rand(1,40));
% cluster_n=2;
% N=4;
% max=1;
% min=0;
% k=size(g,2)/N/cluster_n;
out=zeros(cluster_n,N);
%temcenter=zeros(1,k*N)
for i=1:cluster_n
    temcenter=g((i-1)*N*k+1:i*N*k);
    for j=1:N
        l=temcenter((j-1)*k+1:j*k);
        val=0;
        for m=1:k
            val=val+l(m)*2^(k-m);
        end
        out(i,j)=(max-min)*val/(2^k-1)+min;
    end
end
%result
% g
% center