main.m

来自「动态聚类的k均值算法－－用k均值算法解决动态聚类问题」· M 代码 · 共 34 行

clear all;
close all;
Data=[0 0 1 1 1 2 2 3 6 6 7 7 7 8 8 8 8 9 9 9
      0 1 0 1 2 1 2 2 6 7 6 7 8 6 7 8 9 7 8 9;];
[DataRow,DataColumn]=size(Data);
Step=10;
NumKind=2;
Center=Data(:,1:NumKind);
[KindData,KindNum]=Clustering(Center,Data);
NewCenter=CaculateCenter(KindData,KindNum,DataRow);
while (sum(sum(NewCenter~=Center))) & Step
    Center=NewCenter;
    [KindData,KindNum]=Clustering(Center,Data);
    NewCenter=CaculateCenter(KindData,KindNum,DataRow);
    Step=Step-1;
end

for i=1:NumKind
    KindData(:,1:KindNum(i),i) 
end

if DataRow~=2
    disp('The result can not display on the two-dimensional figure ')
else
    XMin=min(Data(1,:));
    YMin=min(Data(2,:));
    YMax=max(Data(2,:));
    XMax=max(Data(1,:));
    KindDisplay(KindData,KindNum,XMin,XMax,YMin,YMax)
end