聚类小练习2——FSC(Fuzzy subspace clustering)

最新推荐文章于 2022-05-29 16:40:12 发布

昵称每次都被抢

最新推荐文章于 2022-05-29 16:40:12 发布

阅读量865

点赞数

分类专栏： MALTAB

本文链接：https://blog.csdn.net/liyiafeia/article/details/52214693

版权

MALTAB 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

问题同样为聚类小联系一种问题

问题原述：将文件１.ｍａｔ中数据分为两类；

算法介绍见文献：Gan G, Wu J. A convergence theorem for the fuzzy subspace clustering (FSC) algorithm. Pattern Recognition, 2008,41(6):

clear;
clc;
load 1.mat;
jig=data';
z=[jig(1,:)
    jig(2,:)];
w=ones([2,100])./100;
alp=2;
lmd=0.5;
err=0.01;
dd=ones([1,2]);
errma=1;
E=0;
n=1;
while errma>err;
    n=n+1;
    if n==1000000;
        break;
    end
    u=zeros([2,200]);
    for i=1:200;
    for j=1:2;
        dd(1,j)=w(j,:).^alp*((jig(i,:)-z(j,:)).^2)';
        if j==2 && dd(1,j)>dd(1,1);
             u(1,i)=1;
        end
        if j==2 && dd(1,j)<=dd(1,1);
          u(2,i)=1;
        end
    end
    end
    adds=0;
    for j=1:2;
        for i=1:200;
       adds=adds+u(j,i)*w(j,:).^alp*((jig(i,:)-z(j,:)).^2)';
        end
    end
    EE=lmd*sum(sum(w.^alp))+adds;
    errma=abs(EE-E);
    E=EE;
    for j=1:2;
        for h=1:100;
            sum1=0;
            for t=1:100;
                sum2=0;
                sum3=0;
                for i=1:200;
                 sum2=sum2+u(j,i)*(jig(i,j)-z(j,h))^2;
                 sum3=sum3+u(j,i)*(jig(i,t)-z(j,t))^2;
                end
                sum1=sum1+((sum2+lmd)/(sum3+lmd))^(1/(alp-1));
            end
            w(j,h)=1/sum1;
        end
    end
    for j=1:2;
        for h=1:100;
            z(j,h)=u(j,:)*jig(:,h)/sum(u(j,:));
        end
    end
end