clustering.m

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

function [KindData,KindNum]=Clustering(Center,Data)
[DataRow,DataColumn]=size(Data);
[CenterRow,CenterColumn]=size(Center);
KindData=zeros(DataRow,DataColumn,CenterColumn);
KindNum=linspace(0,0,CenterColumn);
for i=1:DataColumn
    Distance=linspace(0,0,CenterColumn);
    for j=1:CenterColumn
        for k=1:DataRow
            Distance(j)=Distance(j)+(Data(k,i)-Center(k,j)).^2;
        end
    end
    Distance=sqrt(Distance);
    [X,Y]=min(Distance);
    KindData(:,KindNum(Y)+1,Y)=Data(:,i);
    KindNum(Y)=KindNum(Y)+1;
end