diff --git a/main.m b/main.m index 17f751c..eca3f4d 100644 --- a/main.m +++ b/main.m @@ -16,7 +16,8 @@ clusterN=10; % end data=rand(Dim,dataN); - +data=load('data'); +data=data.data; SetS=[1;]; @@ -37,18 +38,21 @@ for clusterI=1:clusterN-1 d=data(:,J); %寻找最短距离 minD=1e20; - for D=1:length(SetS)%between j and the closest object in S. -% if J==cadSetS(D) -% continue -% end - distance=sum((d-data(:,SetS(D))).^2).^.5; +% for D=1:length(SetS)%between j and the closest object in S. +% % distance=sum((d-data(:,SetS(D))).^2).^.5; % distance=metricFun( d,data(:,SetS(D)) ); - if distance1e-5 || abs(smin2D-min2D)>1e-5 + fdf=0; + end +% minD=sminD; +% minD +% sminD +% min2D=smin2D; + + % distanceIJ=sum((d-data(:,cadUSetS(H))).^2).^.5;%S(I)已经等于U(H) distanceIJ=metricFun( d,data(:,cadUSetS(H)) ); % distanceHJ=sum((d-data(:,cadSetS(I))).^2).^.5; @@ -99,12 +123,12 @@ while 1 if distanceIJ>minD Kjih=min([distanceHJ-minD,0]); end - if distanceIJ