人工免疫小生境聚类程序.docVIP

clc clear all saw=load(ywh.txt); saw0(:,1:2)=saw(:,3:4); k=3; [m n]=size(saw0); ma=max(saw0); mi=min(saw0); for i=1:m sa(i,:)=(saw0(i,:)-mi)./(ma-mi); end Size=1000; %? 初始代码容量 FG=500;%样本集 BG=50;%解集 BT=100;%优秀 SG=400;%子代 se=0.01; CodeL=15;%二进制长度 P=k*n; E=round(rand(Size,P*CodeL));%初始代码库 count=0; for i=1:FG cn=fix(rand*Size); if cn==0 cn=cn+1; end father(i,:)=E(cn,:); end for i=1:50 [fag]=father2binfun(father,FG,P,CodeL);%转换成十进制解 [bestan,best,bf,zbf]= computfun(sa,fag,FG,k,m,n);%最优解，最优指标，解集，指标值 sl=0.2; [zbf]=xshfun(fag,zbf,sl,k,n); [father]=aiafun(fag,zbf,BG,FG,P,CodeL);%淘汰克隆转换成二进制，变异 end [fag]=father2binfun(father,FG,P,CodeL);;%转换成十进制 [bestan,best,bf,zbf]= computfun(sa,fag,FG,k,m,n);%bestan, xk=bestan; lesa=zeros(k,m); for i=1:m du=zeros(1,k); for j=1:k dup(j,:)=sa(i,:)-xk(j,:); du(1,j)=sum(dup(j,:).^2); end dmi=min(du); df=find(dmi==du); lesa(df,i)=i; end function [fag]=father2binfun(father,FG,P,CodeL) for i=1:FG cnc=0; for j=1:P cnc=(j-1)*CodeL+1; cnl=j*CodeL; temp=father(i,cnc:cnl); fag(i,j)=0; for jk=1:CodeL if temp(1,jk)==1 fag(i,j)=fag(i,j)+1/(2^(jk-1)); end end if fag(i,j)=1 fag(i,j)=fag(i,j)-1; end end end function [bestan,best,bf,zbf]=computfun(sa,fag,FG,k,m,n) lesa=zeros(k,m); zbf=zeros(FG,1); for i=1:FG ax=zeros(k,n); cnc=0; for jk=1:k cnc=(jk-1)*n+1; cnl=jk*n; ax(jk,:)=fag(i,cnc:cnl); end sup=zeros(1,m); for jm=1:m dop=zeros(1,k); for jk=1:k for jn=1:n dop(1,jk)=dop(1,jk)+(sa(jm,jn)-ax(jk,jn))^2; end dop(1,jk)=sqrt(dop(1,jk)); end sup(1,jm)=min(dop); end mup=zeros(k-1,1); for ik=1:k-1 hk=ik; for io=(ik+1):k temp=0; for jn=1:n temp=temp+(ax(hk,jn)-ax(io,jn))