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_euclid(data,varargin)
|
function [R, dmax]= similarity_euclid(data,varargin)
% input: data --- observations x dimensions
% output: R --- nrow * nrow matrix with all the pairwise Euclidean distances
% between nrow observations in the dataset.
nrow = size(data,1);
R=zeros(nrow,nrow);
data = data';
dmax=0;
if nargin == 1
% distance between two observations
for i=1:nrow-1
x=data(:,i);
for j=i+1:nrow
y=x-data(:,j);
d=y'*y;
d=sqrt(d);
R(i,j) = d;
R(j,i) = d;
if d>dmax
dmax=d;
end
end
end
else
% square distance between two observations
for i=1:nrow-1
x=data(:,i);
for j=i+1:nrow
y=x-data(:,j);
d=y'*y;
R(i,j) = d;
R(j,i) = d;
if d>dmax
dmax=d;
end
end
end
end
|
|
Contact us at files@mathworks.com