stepfcm.m

模糊C均值算法的m文件带自己的解释

function [U_new, center, obj_fcn] = stepfcm(data, U, cluster_n, expo)
%STEPFCM One step in fuzzy c-mean clustering.
%   [U_NEW, CENTER, ERR] = STEPFCM(DATA, U, CLUSTER_N, EXPO)
%   performs one iteration of fuzzy c-mean clustering, where
%
%   DATA: matrix of data to be clustered. (Each row is a data point.)
%   U: partition matrix. (U(i,j) is the MF value of data j in cluster j.)
%   CLUSTER_N: number of clusters.
%   EXPO: exponent (> 1) for the partition matrix.
%   U_NEW: new partition matrix.
%   CENTER: center of clusters. (Each row is a center.)
%   ERR: objective function for partition U.
%
%   Note that the situation of "singularity" (one of the data points is
%   exactly the same as one of the cluster centers) is not checked.
%   However, it hardly occurs in practice.
%
%       See also DISTFCM, INITFCM, IRISFCM, FCMDEMO, FCM.

%   Roger Jang, 11-22-94.
%   Copyright 1994-2002 The MathWorks, Inc. 
%   $Revision: 1.13 $  $Date: 2002/04/02 21:25:28 $

mf = U.^expo;       % MF matrix after exponential modification,分配矩阵的权重次方,这和模糊数学书中的一致;
center = mf*data./((ones(size(data, 2), 1)*sum(mf'))'); % new center改变中心, ma*data可细想一下是怎么做到函数目标的,    
dist = distfcm(center, data);       % fill the distance matrix 算出center和data每行的欧氏距离,返回dist(i,j)为center(i,:)与data(j,:)的距离
obj_fcn = sum(sum((dist.^2).*mf));  % objective function   
tmp = dist.^(-2/(expo-1));      % calculate new U, suppose expo != 1
U_new = tmp./(ones(cluster_n, 1)*sum(tmp));