Code covered by the BSD License
-
...
Handle arguments to function
-
[idx,netsim,dpsim,expref,unco...
-
ind2cluster(labels)
-
similarity_euclid(data,vararg...
-
similarity_pearson(data)
pearson coefficients between every two columns
-
similarity_pearsonC(data, C)
pearson coefficients between every column and the center
-
valid_errorate(labels, truela...
computing error rates for every clusters if true labels are given
-
valid_external(index1,c2)
-
valid_sumpearson(data,labels,...
within-, between-cluster and total sum of squares
-
valid_sumsqures(data,labels,k...
data: a matrix with each column representing a variable.
-
test_APclustering.m
-
View all files
from
Semi-supervised Affinity Propagation clustering
by Kaijun Wang
embed Silhouette index into iterations of Affinity propagation clustering to supervise its running
|
| similarity_pearsonC(data, C)
|
function R = similarity_pearsonC(data, C)
% pearson coefficients between every column and the center
% input matrix: data --- nrow rows * ncol columns
% output matrix: R --- ncol columns
[nrow,ncol] = size(data);
dm = mean(data);
data = data-repmat(dm,nrow,1);
C = C-mean(C);
R = ones(1,ncol);
X = sqrt(C'*C);
for j = 1:ncol
y = data(:,j);
xy = C'*y;
Y = sqrt(y'*y);
S = X*Y;
% if S == 0 S = NaN; end
R(j) = xy/S;
end
% Pearson similarity [-1,1] is normalized to Pearson distance [0,1]
R = 1-(1+R)*0.5;
|
|
Contact us at files@mathworks.com