Clustering by fast search and find of density（2）实现

 

matlab实现
 clear;clc;

cluster = 3;

center = 50*randn(3,2);

dcc = 10;

numOfpoint = 300;

for i = 1:numOfpoint

centerindex = randperm(3,1);

centerx = center(centerindex,1);

centery = center(centerindex,2);

theta = rand(1)*2*pi;

radius = dcc*rand(1);

point(i,1) = centerx + radius*cos(theta);

point(i,2) = centery + radius*sin(theta);

end

plot(center(:,1),center(:,2),'r*')

hold on

plot(point(:,1),point(:,2),'bo')

P = [center; point];

distance = zeros(size(P,1));

% first compute distance of each pair

for i = 1:size(P,1)

for j = i+1:size(P,1)

distance(i,j) = sqrt(sum((P(i,:)-P(j,:)).^2));

distance(j,i) = distance(i,j);

end

end

% compute local density of every point

for i = 1:size(P,1)

density(i,1) = length(find(distance(i,:)<dcc))-1;

end

%compute delta

maxdensity = find(density == max(density));

for i = 1:size(P,1)

tempindex = find(density>density(i));

if ~isempty(tempindex)

delta(i,1) = min(distance(i,tempindex));

else

delta(i,1) = max(distance(i,:));

end

end

figure

plot(density,delta,'ro')
--------------------- 
作者：cuifan0814 
来源：CSDN 
原文：https://blog.csdn.net/cuifan0814/article/details/49787691 
版权声明：本文为博主原创文章，转载请附上博文链接！