K-means法matlab的实现.docVIP

算法流程图 实验源代码 1、主程序 clear all clc [FH FW]=textread(C:\Users\lenvo\Desktop\D??¨???t?D\FEMALE.txt,%f %f); [MH MW]=textread(C:\Users\lenvo\Desktop\D??¨???t?D\MALE.txt,%f %f); Data(1:50,1)=FH;Data(51:100,1)=MH; Data(1:50,2)=FW;Data(51:100,2)=MW; C=input(ê?è?C￡o) [U,P,Dist,Cluster_Res,Obj_Fcn,iter]=fuzzycm(Data,C) plot(Data(:,1), Data(:,2),o); hold on; maxU = max(U); index1 = find(U(1,:) == maxU); index2 = find(U(2,:) == maxU); line(Data(index1,1),Data(index1,2),marker,*,color,g); line(Data(index2,1),Data(index2,2),marker,*,color,r); plot([P([1 2],1)],[P([1 2],2)],*,color,k) hold off; 2、子程序 function [U,P,Dist,Cluster_Res,Obj_Fcn,iter]=fuzzycm(Data,C,plotflag,M,epsm) if nargin5 epsm=1.0e-6; end if nargin4 M=2; end if nargin3 plotflag=0; end [N,S]=size(Data);m=2/(M-1);iter=0; Dist(C,N)=0; U(C,N)=0; P(C,S)=0; U0 = rand(C,N); U0=U0./(ones(C,1)*sum(U0)); ¨ while true iter=iter+1; Um=U0.^M; P=Um*Data./(ones(S,1)*sum(Um)); for i=1:C for j=1:N Dist(i,j)=fuzzydist(P(i,:),Data(j,:)); end end U=1./(Dist.^m.*(ones(C,1)*sum(Dist.^(-m)))); if nargout4 | plotflag Obj_Fcn(iter)=sum(sum(Um.*Dist.^2)); end if norm(U-U0,Inf)epsm break end U0=U; end if nargout 3 res = maxrowf(U); for c = 1:C v = find(res==c); Cluster_Res(c,1:length(v))=v; end end if plotflag fcmplot(Data,U,P,Obj_Fcn); end function [U,P,Dist,Cluster_Res,Obj_Fcn,iter]=fuzzycm2(Data,P0,plotflag,M,epsm) if nargin5 epsm=1.0e-6; end if nargin4 M=2; end if nargin3 plotflag=0; end [N,S] = size(Data); m = 2/(M-1); iter = 0; C=size(P0,1);Dist(C,N)=0;U(C,N)=0;P(C,S)=0; while true iter=iter+1; for i=1:C for j=1:N Dist(i,j)=fuzzydist(P0(i,:),Data(j,:)); end end U=1./(Dist.^m.*(ones(C,1)*sum(Dist.^(-m)))); Um=U.^M; P=Um*Data./(ones(S,1)*sum(Um)); if nargout4 | pl