distence.m

来自「数据挖掘K－平均算法的MATLAB程序」· M 代码 · 共 41 行

%================== Distence Matrix =================
for i=1:k
    for j=1:size_data
        a=data(j,1);b=data(j,2);
        c=new_center(i,1);
        d=new_center(i,2);
        disten(j)=sqrt((a-c)^2+(b-d)^2);
    end
    DD(i,:)=disten;
    e(i)=sum(DD(i,:));
end
E(count+1)=sum(e);
%======================= Class =======================
[n1,n2]=size(DD);
for i=1:n2
    for j=1:n1
        dd(j)=DD(j,i);
    end
    mindd=min(dd);
    for k=1:n1
        if(dd(k)==mindd)
            class(i)=k;
        end
    end
end
%============== The Average Value ================
for i=1:k
ad=1;
clear C;
    for j=1:size_data
        if(class(j)==i)
            C(ad,:)=data(j,:);
            ad=ad+1;
        end
    end
    aver_x(i)=sum(C(:,1))/(ad-1);
    aver_y(i)=sum(C(:,2))/(ad-1);
end
%================= New Center Pionts ==============
new_center=[aver_x;aver_y]';