demo.m

来自「最新AP聚类算法以及演示程序」· M 代码 · 共 19 行

%Affinity Propagation (APCLUSTER) sample/demo code

N=100; x=rand(N,2); M=N*N-N; s=zeros(M,3); j=1;
for i=1:N
  for k=[1:i-1,i+1:N]
    s(j,1)=i; s(j,2)=k; s(j,3)=-sum((x(i,:)-x(k,:)).^2);
    j=j+1;
  end;
end;
p=median(s(:,3)); [idx,netsim,dpsim,expref]=apcluster(s,p,'plot');
fprintf('Number of clusters: %d\n',length(unique(idx)));
fprintf('Fitness (net similarity): %g\n',netsim);
figure; for i=unique(idx)'
  ii=find(idx==i); h=plot(x(ii,1),x(ii,2),'o'); hold on;
 % col=rand(1,3); set(h,'Color',col,'MarkerFaceColor',col);
 % xi1=x(i,1)*ones(size(ii)); xi2=x(i,2)*ones(size(ii)); 
%  line([x(ii,1),xi1]',[x(ii,2),xi2]','Color',col);
end;
axis equal tight;