function [a,k]= feijiandu(a1,a2,a3,a4,a5)
%a1,a2,a3,a4为初始中心，a5为分类矩阵,k为迭代次数，a为分类结果
%UNTITLED2 此处显示有关此函数的摘要
% 此处显示详细说明
n=length(a5);
a=zeros(n,1);
k=0;
while(true)
n1=0;n2=0;n3=0;n4=0;
s1=zeros(1,8);s2=zeros(1,8);s3=zeros(1,8);s4=zeros(1,8);
for i=1:n
x=a5(i,:);
d1=sqrt((x-a1)*(x-a1)');
d2=sqrt((x-a2)*(x-a2)');
d3=sqrt((x-a3)*(x-a3)');
d4=sqrt((x-a4)*(x-a4)');
d5=[d1,d2,d3,d4];
d=min(d5);
if(d==d1)
s1=s1+x;
n1=n1+1;
a(i,1)=1;
end
if(d==d2)
s2=s2+x;
n2=n2+1;
a(i,1)=2;
end
if(d==d3)
s3=s3+x;
n3=n3+1;
a(i,1)=3;
end
if(d==d4)
s4=s4+x;
n4=n4+1;
a(i,1)=4;
end
end
a11=a1;a22=a2;a33=a3;a44=a4;
a1=s1/n1;a2=s2/n2;a3=s3/n3;a4=s4/n4;
f1=a11*a11';f2=a22*a22';f3=a33*a33';f4=a44*a44';
t1=a1*a1';t2=a2*a2';t3=a3*a3';t4=a4*a4';
if(f1==t1 && f2==t2 && f3==t3 &&f4==t4)
break;
end
k=k+1;
if(k>2000)
break;
end
end
end
